Sciweavers

940 search results - page 182 / 188
» Local rely-guarantee reasoning
Sort
View
ATAL
2010
Springer
15 years 25 days ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
ATAL
2010
Springer
15 years 25 days ago
History-dependent graphical multiagent models
A dynamic model of a multiagent system defines a probability distribution over possible system behaviors over time. Alternative representations for such models present tradeoffs i...
Quang Duong, Michael P. Wellman, Satinder P. Singh...
SIGCOMM
2010
ACM
14 years 12 months ago
Generic and automatic address configuration for data center networks
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
Kai Chen, Chuanxiong Guo, Haitao Wu, Jing Yuan, Zh...
ADHOC
2008
111views more  ADHOC 2008»
14 years 12 months ago
MERLIN: Cross-layer integration of MAC and routing for low duty-cycle sensor networks
Sensor network MAC protocols typically sacrifice packet latency to achieve energy efficiency. Such delays may well increase due to routing protocol operation. For this reason it i...
Antonio G. Ruzzelli, Gregory M. P. O'Hare, Raja Ju...
AI
2008
Springer
14 years 12 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini