Sciweavers

1615 search results - page 97 / 323
» Pathology in heuristic search
Sort
View
AGTIVE
2007
Springer
15 years 6 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß
EVOW
2007
Springer
15 years 6 months ago
Generation of Tree Decompositions by Iterated Local Search
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...
Nysret Musliu
JCO
1998
136views more  JCO 1998»
14 years 11 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...
ECAI
2004
Springer
15 years 5 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 1 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