Sciweavers

14 search results - page 1 / 3
» Choice Coordination with Multiple Alternatives (Preliminary ...
Sort
View
79
Voted
WDAG
1992
Springer
104views Algorithms» more  WDAG 1992»
15 years 2 months ago
Choice Coordination with Multiple Alternatives (Preliminary Version)
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang
AAMAS
2011
Springer
14 years 5 months ago
Using focal point learning to improve human-machine tacit coordination
We consider an automated agent that needs to coordinate with a human partner when communication between them is not possible or is undesirable (tacit coordination games). Specifi...
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschei...
COORDINATION
2007
Springer
15 years 5 months ago
Generalized Committed Choice
We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations ...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
16 years 5 days ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
NETGAMES
2005
ACM
15 years 4 months ago
Game server selection for multiple players
The increase in power and connectivity of computers has enabled a growth in network games, with many games having numerous servers to which a player can connect. The game server s...
Steven Gargolinski, Christopher St. Pierre, Mark C...