5316 search results - page 92 / 1064 » Which Search Problems Are Random |
122
click to vote
AAAI
2004
15 years 4 months ago
2004
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
136
click to vote
HEURISTICS
2002
15 years 3 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
111
Voted
EOR
2008
15 years 3 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
141
click to vote
FPL
2003
Springer
15 years 8 months ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
118
Voted
CSCWD
2009
Springer
15 years 10 months ago
2009
Springer
Constrained random simulation methodology still plays an important role in hardware verification due to the limited scalability of formal verification, especially for the large an...