212 search results - page 17 / 43 » Electoral search using the VerkiezingsKijker: an experience ... |
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
AAAI
1994
13 years 9 months ago
1994
To navigate effectively, an autonomous agent must be able to quickly and accurately determine its current location. Given an initial estimate of its position (perhaps based on dea...
ML
2000
ACM
13 years 7 months ago
2000
ACM
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
CLEF
2009
Springer
13 years 9 months ago
2009
Springer
In this paper we report the experiments for the CLEF 2009 Robust-WSD task, both for the monolingual (English) and the bilingual (Spanish to English) subtasks. Our main experimenta...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...