Sciweavers

3055 search results - page 393 / 611
» Randomized Search Trees
Sort
View
OL
2007
121views more  OL 2007»
15 years 3 months ago
Global optimization by continuous grasp
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
Michael J. Hirsch, Cláudio Nogueira de Mene...
NMA
2010
15 years 1 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
AI
2006
Springer
15 years 4 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
ICML
2009
IEEE
16 years 4 months ago
Monte-Carlo simulation balancing
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
David Silver, Gerald Tesauro
SASO
2007
IEEE
15 years 10 months ago
Improving ICE Service Selection in a P2P System using the Gradient Topology
Internet Connectivity Establishment (ICE) is becoming increasingly important for P2P systems on the open Internet, as it enables NAT-bound peers to provide accessible services. A ...
Jim Dowling, Jan Sacha, Seif Haridi