2084 search results - page 351 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
MOBICOM
2006
ACM
15 years 3 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
169
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
110
click to vote
ATAL
2011
Springer
13 years 9 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...