Sciweavers

1639 search results - page 117 / 328
» Anytime Heuristic Search
Sort
View
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
14 years 2 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
ECAI
2006
Springer
14 years 1 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 years 1 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
KDD
1995
ACM
133views Data Mining» more  KDD 1995»
14 years 1 months ago
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...
Ron Kohavi, Dan Sommerfield
WWW
2011
ACM
13 years 5 months ago
Domain-independent entity extraction from web search query logs
Query logs of a Web search engine have been increasingly used as a vital source for data mining. This paper presents a study on largescale domain-independent entity extraction fro...
Alpa Jain, Marco Pennacchiotti