109 search results - page 3 / 22 » Two local search approaches for solving real-life car sequen... |
IJCAI
2001
13 years 8 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
PRICAI
2004
Springer
14 years 21 days 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...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
HEURISTICS
2010
13 years 4 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
GECCO
1999
Springer
13 years 11 months ago
1999
Springer
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...