701 search results - page 116 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
PAMI
2006
13 years 7 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
AIPS
2008
13 years 9 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
COLT
2004
Springer
14 years 24 days ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...