103 search results - page 8 / 21 » Solving the Crane Scheduling Problem Using Intelligent Searc... |
AMAI
2004
Springer
14 years 27 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
AIPS
2006
13 years 9 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
CP
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. 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 de...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
AISB
1995
Springer
13 years 11 months ago
1995
Springer
This paper presents an evolutionary algorithm for solving parameter optimization problems in parametric array signal processing. The method utilises the niche concept to maintain a...