1197 search results - page 26 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
145
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
163
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
156
click to vote
SARA
2009
Springer
16 years 6 days ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
161
click to vote
FLAIRS
2003
15 years 7 months ago
2003
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
150
click to vote
TASE
2008
IEEE
15 years 5 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...