527 search results - page 99 / 106 » Implementation of Approximation Algorithms for the Multicast... |
ICDCN
2009
Springer
14 years 2 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
WSDM
2010
ACM
14 years 4 months ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
EUROPAR
2005
Springer
14 years 26 days ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...