Sciweavers

2457 search results - page 177 / 492
» Local Search with Bootstrapping
Sort
View
ECAI
2010
Springer
15 years 5 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
IPL
2002
119views more  IPL 2002»
15 years 3 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
TEC
2002
163views more  TEC 2002»
15 years 3 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
WSC
2004
15 years 5 months ago
Global Likelihood Optimization Via the Cross-Entropy Method, with an Application to Mixture Models
Global likelihood maximization is an important aspect of many statistical analyses. Often the likelihood function is highly multi-extremal. This presents a significant challenge t...
Zdravko I. Botev, Dirk P. Kroese
DEXA
2006
Springer
126views Database» more  DEXA 2006»
15 years 6 months ago
Hypersphere Indexer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
Navneet Panda, Edward Y. Chang, Arun Qamra