1614 search results - page 99 / 323 » Breadth-First Heuristic Search |
158
click to vote
EVOW
2007
Springer
16 years 9 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
181
click to vote
JCO
1998
15 years 5 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
202
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
153
click to vote
COLING
2008
15 years 7 months ago
2008
Semantic relatedness between words is important to many NLP tasks, and numerous measures exist which use a variety of resources. Thus far, such work is confined to measuring simil...
181
click to vote
CIBCB
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...