Sciweavers

6095 search results - page 37 / 1219
» Learning in Local Search
Sort
View
PVM
2004
Springer
14 years 2 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 7 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
NIPS
2008
13 years 10 months ago
On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor
In this theoretical contribution we provide mathematical proof that two of the most important classes of network learning - correlation-based differential Hebbian learning and rew...
Christoph Kolodziejski, Bernd Porr, Minija Tamosiu...
ICML
2009
IEEE
14 years 9 months ago
Stochastic search using the natural gradient
Daan Wierstra, Jürgen Schmidhuber, Tom Schaul...
ACML
2009
Springer
14 years 3 months ago
Monte-Carlo Tree Search in Poker Using Expected Reward Distributions
Guy Van den Broeck, Kurt Driessens, Jan Ramon