1191 search results - page 85 / 239 » Completeness and Performance Of The APO Algorithm |
126
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
144
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
142
Voted
EICS
2009
ACM
15 years 10 months ago
2009
ACM
This paper evaluates the input performance capabilities of Velocity Threshold (I-VT) and Kalman Filter (I-KF) eye movement detection models when employed for eye-gaze-guided inter...
117
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we present the venture of porting two different algorithms for solving the two-dimensional advection PDE on the CBE platform, an in-place and an outof-place one, and ...
112
Voted
AMAI
2008
Springer
15 years 3 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...