Sciweavers

1615 search results - page 48 / 323
» Pathology in heuristic search
Sort
View
WILF
2005
Springer
194views Fuzzy Logic» more  WILF 2005»
14 years 3 months ago
Learning Bayesian Classifiers from Gene-Expression MicroArray Data
Computing methods that allow the efficient and accurate processing of experimentally gathered data play a crucial role in biological research. The aim of this paper is to present a...
Andrea Bosin, Nicoletta Dessì, Diego Libera...
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 9 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
AAAI
2010
13 years 11 months ago
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
Carmel Domshlak, Erez Karpas, Shaul Markovitch
CP
2005
Springer
14 years 3 months ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
ECAI
2010
Springer
13 years 11 months ago
Strengthening Landmark Heuristics via Hitting Sets
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
Blai Bonet, Malte Helmert