3055 search results - page 234 / 611 » Randomized Search Trees |
GCB
1997
Springer
15 years 5 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
115
click to vote
AIPS
2004
15 years 2 months ago
2004
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
123
click to vote
IJCAI
2003
15 years 2 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
129
click to vote
AUSAI
2010
Springer
15 years 4 days ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
110
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...