Sciweavers

8298 search results - page 1588 / 1660
» On the Complexity of Numerical Analysis
Sort
View
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
IPPS
2002
IEEE
15 years 11 months ago
Performance Prediction Technology for Agent-Based Resource Management in Grid Environments
Resource management constitutes an important infrastructural component of a computational grid environment. The aim of grid resource management is to efficiently schedule applicat...
Junwei Cao, Stephen A. Jarvis, Daniel P. Spooner, ...
VISUALIZATION
2002
IEEE
15 years 11 months ago
Fast Visualization of Plane-Like Structures in Voxel Data
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
Steffen Prohaska, Hans-Christian Hege
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 11 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
« Prev « First page 1588 / 1660 Last » Next »