Result 1 to 20 of 834 total
Exact and approximation algorithms for geometric and capacitated set cover problems. (English)
Algorithmica 64, No. 2, 295-310 (2012).
1
A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale. (English)
Comput. Oper. Res. 39, No. 7, 1771-1778 (2012).
2
On centralized PC grammar systems with context-sensitive components. (English)
Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 356-367 (2012).
3
Convergence analysis and improvements of quantum-behaved particle swarm optimization. (English)
Inf. Sci. 193, 81-103 (2012).
4
Almost-optimal gossip-based aggregate computation. (English)
SIAM J. Comput. 41, No. 3, 455-483 (2012).
5
A large population size can be unhelpful in evolutionary algorithms. (English)
Theor. Comput. Sci. 436, 54-70 (2012).
6
On the approximation ability of evolutionary optimization with application to minimum set cover. (English)
Artif. Intell. 180-181, 20-33 (2012).
7
Of choices, failures and asynchrony: the many faces of set agreement. (English)
Algorithmica 62, No. 1-2, 595-629 (2012).
8
A new class of polynomial interior-point algorithm for $P_* (κ)$ linear complementarity problems. (Chinese)
Math. Pract. Theory 41, No. 3, 192-201 (2011).
9
The recursive transformation algorithms between forest and binary tree. (English)
Zhou, Qihai (ed.), Theoretical and mathematical foundations of computer science. Second international conference, ICTMF 2011, Singapore, May 5‒6, 2011. Selected papers. Berlin: Springer (ISBN 978-3-642-24998-3/pbk; 978-3-642-24999-0/ebook). Communications in Computer and Information Science 164, 227-230 (2011).
10
Trade-offs between time, space, cooperation, and communication complexity for CD grammar systems. (English)
Fundam. Inform. 107, No. 4, 345-378 (2011).
11
The most vital nodes with respect to independent set and vertex cover. (English)
Discrete Appl. Math. 159, No. 17, 1933-1946 (2011).
12
The graph-bin packing problem. (English)
Int. J. Found. Comput. Sci. 22, No. 8, 1971-1993 (2011).
13
Fast adaptive similarity-based clustering using sparse Parzen window density estimation. (Chinese)
Acta Autom. Sin. 37, No. 2, 179-187 (2011).
14
Reducible braids and Garside theory. (English)
Algebr. Geom. Topol. 11, No. 5, 2971-3010 (2011).
15
Average time complexity of decision trees. (English)
Intelligent Systems Reference Library 21. Berlin: Springer (ISBN 978-3-642-22660-1/hbk; 978-3-642-22661-8/ebook). xii, 101~p. EUR~99.95/net; SFR~143.50; \sterling~90.00; \$~129.00 (2011).
16
On dynamic shortest paths problems. (English)
Algorithmica 61, No. 2, 389-401 (2011).
17
Growth in Baumslag-Solitar groups. I: Subgroups and rationality. (English)
LMS J. Comput. Math. 14, 34-71, electronic only (2011).
18
A fast output-sensitive algorithm for Boolean matrix multiplication. (English)
Algorithmica 61, No. 1, 36-50 (2011).
19
On the maximum locally clustered subgraph and some related problems. (English)
Wang, Weifan (ed.) et al., Combinatorial optimization and applications. 5th international conference, COCOA 2011, Zhangjiajie, China, August 4‒6, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22615-1/pbk). Lecture Notes in Computer Science 6831, 234-246 (2011).
20
Result 1 to 20 of 834 total
Start
Contact
Print
General Help
