1632 search results - page 118 / 327 » Sublinear Time Algorithms for Metric Space Problems |
138
Voted
AIPS
2000
15 years 5 months ago
2000
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
143
click to vote
PKDD
2001
Springer
15 years 8 months ago
2001
Springer
This paper discusses the clustering quality and complexities of the hierarchical data clustering algorithm based on gravity theory. The gravitybased clustering algorithm simulates ...
118
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
338
click to vote
EC
2012
13 years 11 months ago
2012
In a multimodal optimization task, the main purpose is to find multiple optimal solutions (global and local), so that the user can have a better knowledge about different optima...
148
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...