1402 search results - page 239 / 281 » Sparse-Memory Graph Search |
132
click to vote
ANTSW
2004
Springer
15 years 3 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
AIRWEB
2007
Springer
15 years 3 months ago
2007
Springer
The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other ...
105
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
MVA
2007
15 years 1 months ago
2007
This paper presents a new reliable detection of core and delta in fingerprints by candidate analysis. The line search based method, which is one of the reliable approaches to dete...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...