Result 1 to 20 of 1845 total
Spanning cactus of a graph: Existence, extension, optimization, and approximation. (English)
Discrete Appl. Math. 161, No. 1-2, 167-175 (2013).
1
On the approximability of Dodgson and Young elections. (English)
Artif. Intell. 187-188, 31-51 (2012).
2
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities. (English)
Inf. Process. Lett. 112, No. 23, 903-907 (2012).
3
Multicriteria movement synchronization scheduling problems and algorithms. (English)
Optimization 61, No. 8, 1039-1073 (2012).
4
Accepting networks of genetic processors are computationally complete. (English)
Theor. Comput. Sci. 456, 18-29 (2012).
5
Ockham’s Razor in memetic computing: three stage optimal memetic exploration. (English)
Inf. Sci. 188, 17-43 (2012).
6
Complexity and approximation of the connected set-cover problem. (English)
J. Glob. Optim. 53, No. 3, 563-572 (2012).
7
Faster geometric algorithms via dynamic determinant computation. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 443-454 (2012).
8
Combinatorial optimization of cycles and bases. (English)
Zomorodian, Afra (ed.), Advances in applied and computational topology. AMS short course on computational topology, New Orleans, LA, USA, January 4‒5, 2011. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-5327-6/hbk). Proceedings of Symposia in Applied Mathematics 70, 195-228 (2012).
9
Adaptive wavelet methods. (English)
Naldi, Giovanni (ed.) et al., Multiscale and adaptivity: Modeling, numerics and applications. C.I.M.E. summer school, Cetraro, Italy, July 6‒11, 2009. Berlin: Springer; Firenze: Fondazione CIME Roberto Conti (ISBN 978-3-642-24078-2/pbk; 978-3-642-24079-9/ebook). Lecture Notes in Mathematics 2040, 1-56 (2012).
10
Fast algorithms for high frequency wave propagation. (English)
Graham, Ivan G. (ed.) et al., Numerical analysis of multiscale problems. Selected papers based on the presentations at the 91st London Mathematical Society symposium, Durham, UK, July 5‒15, 2010. Berlin: Springer (ISBN 978-3-642-22060-9/hbk; 978-3-642-22061-6/ebook). Lecture Notes in Computational Science and Engineering 83, 127-161 (2012).
11
Approximability of constrained LCS. (English)
J. Comput. Syst. Sci. 78, No. 3, 689-697 (2012).
12
Formalizing randomized matching algorithms. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 5, 27 p., electronic only (2012).
13
A note on SAT algorithms and proof complexity. (English)
Inf. Process. Lett. 112, No. 12, 490-493 (2012).
14
A survey on recent development in computational quasi-conformal geometry and its applications. (English)
Ji, Lizhen (ed.) et al., Fifth international congress of Chinese mathematicians. Proceedings of the ICCM ’10, Beijing, China, December 17‒22, 2010. Part 2. Providence, RI: American Mathematical Society (AMS); Somerville, MA: International Press (ISBN 978-0-8218-7587-2/pbk; 978-0-8218-7555-1/set). AMS/IP Studies in Advanced Mathematics 51, pt.2, 697-717 (2012).
15
The use of tail inequalities on the probable computational time of randomized search heuristics. (English)
Theor. Comput. Sci. 436, 106-117 (2012).
16
A large population size can be unhelpful in evolutionary algorithms. (English)
Theor. Comput. Sci. 436, 54-70 (2012).
17
Influence of tree topology restrictions on the complexity of haplotyping with missing data. (English)
Theor. Comput. Sci. 432, 38-51 (2012).
18
Maxima-finding algorithms for multidimensional samples: A two-phase approach. (English)
Comput. Geom. 45, No. 1-2, 33-53 (2012).
19
Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis. (English)
Theor. Comput. Sci. 428, 58-79 (2012).
20
Result 1 to 20 of 1845 total
Start
Contact
Print
General Help
