Sciweavers

803 search results - page 154 / 161
» Game Theory and Decision Theory in Multi-Agent Systems
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICAIL
2005
ACM
14 years 18 days ago
A study of accrual of arguments, with applications to evidential reasoning
d on Dung’s [4] abstract argumentation system • arguments: trees of chained defeasible inferences • aim: determine the status of a query given a belief base • incorporation...
Henry Prakken
EMSOFT
2004
Springer
14 years 13 days ago
Reactive process networks
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
Marc Geilen, Twan Basten
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Noncooperative power control and transmission scheduling in wireless collision channels
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
Ishai Menache, Nahum Shimkin
SIGCOMM
2005
ACM
14 years 18 days ago
Implications of autonomy for the expressiveness of policy routing
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, a...
Nick Feamster, Ramesh Johari, Hari Balakrishnan