2108 search results - page 142 / 422 » Constrained Heuristic Search |
172
click to vote
IJCAI
2003
15 years 3 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
149
Voted
ECAI
2004
Springer
15 years 7 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 (...
98
Voted
COLING
2008
15 years 3 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...
121
Voted
CIBCB
2009
IEEE
15 years 3 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 ...
202
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...