Sciweavers

1615 search results - page 49 / 323
» Pathology in heuristic search
Sort
View
CP
2007
Springer
14 years 4 months ago
Model-Driven Visualizations of Constraint-Based Local Search
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet ...
Grégoire Dooms, Pascal Van Hentenryck, Laur...
ICGI
2004
Springer
14 years 3 months ago
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
John Abela, François Coste, Sandro Spina
IJAIT
2002
81views more  IJAIT 2002»
13 years 9 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
ICTAI
2009
IEEE
13 years 7 months ago
Stochastic Offline Programming
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
Yuri Malitsky, Meinolf Sellmann
IJCBDD
2008
113views more  IJCBDD 2008»
13 years 10 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...