566 search results - page 32 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
96
Voted
PPSN
1998
Springer
15 years 4 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
104
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
90
Voted
AI
2005
Springer
15 years 10 days ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
CORR
2008
Springer
15 years 15 days ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
93
Voted
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...