Sciweavers

1639 search results - page 197 / 328
» Anytime Heuristic Search
Sort
View
IJCAI
1997
13 years 10 months ago
Toward Structured Retrieval in Semi-structured Information Spaces
A semi-structured information space consists of multiple collections of textual documents containing fielded or tagged sections. The space can be highly heterogeneous, because eac...
Scott B. Huffman, Catherine Baudin
AAAI
1996
13 years 10 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
CEC
2010
IEEE
13 years 6 months ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Pedro Gómez-Meneses, Marcus Randall, Andrew...
IJCAI
2003
13 years 10 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
ISMB
2004
13 years 10 months ago
Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy
Motivation: Non-coding RNAs (ncRNAs)--functional RNA molecules not coding for proteins--are grouped into hundreds of families of homologs. To find new members of an ncRNA gene fam...
Zasha Weinberg, Walter L. Ruzzo