1844 search results - page 34 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
101
click to vote
IAT
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
134
click to vote
PROCEDIA
2011
14 years 2 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
MICAI
2004
Springer
15 years 4 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
GECCO
2008
Springer
15 years 7 days ago
2008
Springer
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of t...
ATAL
2005
Springer
15 years 4 months ago
2005
Springer
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...