717 search results - page 96 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
100
click to vote
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
EC
2008
14 years 10 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
CONSTRAINTS
2007
14 years 9 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...