805 search results - page 157 / 161 » Combinatorial optimization problems in self-assembly |
ICCS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
COMSWARE
2006
IEEE
14 years 3 months ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
ILP
2004
Springer
14 years 3 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
WIOPT
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract—The cross-layer utility maximization problem subject to stability constraints is considered for a multi-hop wireless network. A time slotted network, where the channel g...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...