ESA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Neural networks are a popular technique for learning the adaptive control of non-linear plants. When applied to the complex control of android robots, however, they suffer from se...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Selecting which algorithms should be used by a mobile robot computer vision system is a decision that is usually made a priori by the system developer, based on past experience and...
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
DIALM
2008
ACM
13 years 11 months ago
2008
ACM
