Sciweavers

1410 search results - page 113 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
INFOCOM
2010
IEEE
14 years 9 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
VTC
2007
IEEE
105views Communications» more  VTC 2007»
15 years 5 months ago
Scheduling Algorithms For Policy Driven QoS Support in HSDPA Networks
— Increasing demand for high data-rate multimedia services has led to the emergence of high-speed data transfer features such as High-Speed Downlink Packet Access (HSDPA) for WCD...
Joseph S. Gomes, Mira Yun, Hyeong-Ah Choi, Jae-Hoo...
ATAL
2006
Springer
15 years 1 months ago
Can good learners always compensate for poor learners?
Can a good learner compensate for a poor learner when paired in a coordination game? Previous work has given an example where a special learning algorithm (FMQ) is capable of doin...
Keith Sullivan, Liviu Panait, Gabriel Catalin Bala...
FSTTCS
2008
Springer
15 years 14 days ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
IAT
2007
IEEE
15 years 5 months ago
A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions
The agents in multiagent systems can coordinate their actions and handle tasks jointly by forming coalitions. One of the important steps in this process is the fair division of pa...
Hrishikesh J. Goradia, José M. Vidal