333 search results - page 9 / 67 » Speeding up moving-target search |
168
click to vote
TIP
2002
15 years 6 months ago
2002
In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) ini...
182
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
141
click to vote
CAEPIA
2007
Springer
15 years 10 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
165
Voted
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two parallelization strategies are integrated: functional decomposit...
152
click to vote
AISC
2006
Springer
15 years 10 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...