Sciweavers

805 search results - page 13 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
MP
2010
116views more  MP 2010»
13 years 8 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford
AUSAI
2005
Springer
13 years 11 months ago
Understanding the Pheromone System Within Ant Colony Optimization
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
Stephen Gilmour, Mark Dras
CISS
2010
IEEE
13 years 1 months ago
Transmission coordination for ad hoc networks
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
Ananth V. Kini, Steven Weber, Fadi A. Aloul, Nagar...
EOR
2008
91views more  EOR 2008»
13 years 10 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 7 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor