Sciweavers

617 search results - page 57 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
UAI
2003
13 years 9 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 2 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
FLAIRS
2001
13 years 9 months ago
Introducing Local Optimization for Effective Initialization and Crossover of Genetic Decision Trees
We introduce a new genetic operator, Reduction, that rectifies decision trees not correct syntactically and at the same time removes the redundant sections within, while preservin...
Arindam Basak, Sudeshna Sarkar
FGCS
2008
95views more  FGCS 2008»
13 years 6 months ago
SemreX: Efficient search in a semantic overlay for literature retrieval
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
Hai Jin, Hanhua Chen
COR
2010
166views more  COR 2010»
13 years 8 months ago
Variable neighbourhood decomposition search for 0-1 mixed integer programs
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic,...