1914 search results - page 12 / 383 » Evaluation of a Catalytic Search Algorithm |
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
PAMI
2006
13 years 7 months ago
2006
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
ISHPC
2003
Springer
14 years 17 days ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
TSMC
2011
13 years 2 months ago
2011
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
AUSAI
1999
Springer
13 years 11 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...