Sciweavers

1614 search results - page 101 / 323
» Breadth-First Heuristic Search
Sort
View
AAAI
1998
15 years 5 months ago
A Feature-Based Learning Method for Theorem Proving
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...
Matthias Fuchs
SAT
2009
Springer
91views Hardware» more  SAT 2009»
15 years 10 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 7 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
EOR
2006
129views more  EOR 2006»
15 years 4 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
EOR
2006
128views more  EOR 2006»
15 years 4 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...