Sciweavers

3499 search results - page 97 / 700
» On the local optimality of LambdaRank
Sort
View
NIPS
2007
14 years 11 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 4 months ago
A memetic algorithm for the low autocorrelation binary sequence problem
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
DAWAK
2005
Springer
15 years 3 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
CADE
1998
Springer
15 years 2 months ago
System Description: CRIL Platform for SAT
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
ANTSW
2008
Springer
15 years 2 days ago
A Dynamic Swarm for Visual Location Tracking
Abstract. The visual localization problem in robotics poses a dynamically changing environment due to the movement of the robot compared to a static image set serving as environmen...
Marcel Kronfeld, Christian Weiss, Andreas Zell