2084 search results - page 187 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
103
Voted
IROS
2006
IEEE
15 years 8 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
149
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
Research in the areas of privacy preserving techniques in databases and subsequently in privacy enhancement technologies have witnessed an explosive growth-spurt in recent years. ...
125
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
— Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the ...
124
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], arg...
105
Voted
IJCAI
2001
15 years 4 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...