Sciweavers

14158 search results - page 304 / 2832
» Generalized switch-setting problems
Sort
View
GECCO
2007
Springer
143views Optimization» more  GECCO 2007»
16 years 25 days ago
Learning and exploiting knowledge in multi-agent task allocation problems
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
Adam Campbell, Annie S. Wu
CONEXT
2006
ACM
16 years 19 days ago
Reformulating the monitor placement problem: optimal network-wide sampling
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
Gion Reto Cantieni, Gianluca Iannaccone, Chadi Bar...
QSHINE
2005
IEEE
16 years 7 days ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
SAC
2005
ACM
16 years 6 days ago
Box-set consistency for interval-based constraint problems
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
Gilles Chabert, Gilles Trombettoni, Bertrand Neveu
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 5 days ago
Evolving neural network ensembles for control problems
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
David Pardoe, Michael S. Ryoo, Risto Miikkulainen