701 search results - page 108 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
132
Voted
IJCAI
2003
15 years 4 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
156
click to vote
AC
2000
Springer
15 years 7 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
111
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
148
Voted
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
145
Voted
NIPS
2001
15 years 4 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...