14 search results - page 1 / 3 » Caching Search States in Permutation Problems |
CP
2005
Springer
13 years 10 months ago
2005
Springer
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
TOPNOC
2010
12 years 11 months ago
2010
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
In the past, several attempts have been made to deal with the state space explosion problem by equipping a depth-first search (DFS) algorithm with a state cache, or by avoiding co...
EOR
2007
13 years 4 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
ISCAS
2006
IEEE
13 years 11 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...