2084 search results - page 299 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
106
Voted
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
103
click to vote
ROBOCOMM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
-In order to implement a continuous and robust dynamic localization of a mobile robot, the fusion of dead reckoning and absolute sensors is often used. Depending on the objectives ...
FLAIRS
2008
15 years 6 days ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
ICML
1995
IEEE
15 years 10 months ago
1995
IEEE
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...