2735 search results - page 426 / 547 » Comparing notions of randomness |
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
117
Voted
BROADNETS
2006
IEEE
15 years 4 months ago
2006
IEEE
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
123
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
122
Voted
EMO
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Optimization in changing environment is a challenging task, especially when multiple objectives are to be optimized simultaneously. The basic idea to address dynamic opti...
109
Voted
ESOA
2006
15 years 4 months ago
2006
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...