805 search results - page 99 / 161 » Combinatorial optimization problems in self-assembly |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
ICCS
2003
Springer
15 years 3 months ago
2003
Springer
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
100
click to vote
ISSAC
1992
Springer
15 years 2 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
FCT
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
IEAAIE
2010
Springer
14 years 8 months ago
2010
Springer
Swarm Intelligence has been a successful approach to solve some combinatorial problems through the metaphor of interacting evolving individuals of a a population P in a closed toru...