Sciweavers

292 search results - page 7 / 59
» Objects Shared by Byzantine Processes
Sort
View
GI
2009
Springer
13 years 6 months ago
An Improved Method for creating Shared Belief in Communication Constrained Sensor Networks
: Networked systems that gather sensor data in order to react to phenomena in their surroundings are faced with a growing need for adaptive behavior to operate in dynamically chang...
Eelke van Foeken, Peter Hiemstra, Leon Kester
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 9 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
PVLDB
2008
124views more  PVLDB 2008»
13 years 8 months ago
Scheduling shared scans of large data files
We study how best to schedule scans of large data files, in the presence of many simultaneous requests to a common set of files. The objective is to maximize the overall rate of p...
Parag Agrawal, Daniel Kifer, Christopher Olston
INFOCOM
2008
IEEE
14 years 3 months ago
Modeling Resource Sharing Dynamics of VoIP Users over a WLAN Using a Game-Theoretic Approach
—We consider a scenario in which users share an access point and are mainly interested in VoIP applications. Each user is allowed to adapt to varying network conditions by choosi...
Edson H. Watanabe, Daniel S. Menasché, Edmu...
PODC
1991
ACM
14 years 7 days ago
Randomized Wait-Free Concurrent Objects (Extended Abstract)
d abstract) Maurice Herlihy Digital Equipment Corporation Cambridge Research Laboratory One Kendall Square Cambridge MA, 02139 Digital Equipment Corporation Cambridge Research Lab ...
Maurice Herlihy