1263 search results - page 82 / 253 » A* with Bounded Costs |
237
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
161
click to vote
ARGMAS
2005
Springer
15 years 11 months ago
2005
Springer
Recent years have seen an increasing interest of multiagent system research in employing the theory of argumentation for the development of communication protocols. While signific...
169
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
163
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
148
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
The number of triangles in arrangements of lines and pseudolines has been object of some research. Most results, however, concern arrangements in the projective plane. In this arti...