3055 search results - page 278 / 611 » Randomized Search Trees |
139
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...
123
click to vote
EMO
2005
Springer
15 years 9 months ago
2005
Springer
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
135
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
200
Voted
TELSYS
2011
14 years 10 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
124
click to vote
CG
2010
Springer
15 years 1 months ago
2010
Springer
Monte Carlo Tree Search has given computer go a significant boost in strength the past few years, but progress seems to have slowed, and once again we have to ask ourselves how can...