167 search results - page 5 / 34 » A Genetic Local Search Algorithm for Random Binary Constrain... |
137
Voted
PRICAI
2004
Springer
15 years 8 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
123
Voted
SARA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
137
Voted
IJCAI
2003
15 years 4 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
120
Voted
FLAIRS
2004
15 years 4 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
136
Voted
CP
1997
Springer
15 years 7 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...