Sciweavers

1589 search results - page 98 / 318
» Multiple-Goal Heuristic Search
Sort
View
149
Voted
JCO
1998
136views more  JCO 1998»
15 years 3 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
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...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
162
Voted
ECAI
2004
Springer
15 years 9 months ago
Boosting Systematic Search by Weighting Constraints
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 (...
Frédéric Boussemart, Fred Hemery, Ch...
COLING
2008
15 years 5 months ago
Using Web-Search Results to Measure Word-Group Similarity
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...
Ann Gledson, John Keane
141
Voted
CIBCB
2009
IEEE
15 years 4 months ago
rnaDesign: Local search for RNA secondary structure design
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 ...
Denny C. Dai, Herbert H. Tsang, Kay C. Wiese
228
Voted
CP
2009
Springer
16 years 4 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
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 ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey