2084 search results - page 388 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
100
Voted
PODC
1997
ACM
15 years 1 months ago
1997
ACM
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
WS
2005
ACM
15 years 3 months ago
2005
ACM
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...
172
click to vote
GIS
2008
ACM
15 years 10 months ago
2008
ACM
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
INFFUS
2008
14 years 9 months ago
2008
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...