Sciweavers

1410 search results - page 245 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
MOBIHOC
2007
ACM
16 years 2 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
120
Voted
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 20 days ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
TACAS
2010
Springer
145views Algorithms» more  TACAS 2010»
15 years 10 months ago
Rational Synthesis
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
Dana Fisman, Orna Kupferman, Yoad Lustig
MM
2006
ACM
181views Multimedia» more  MM 2006»
15 years 9 months ago
Peer-to-peer multimedia applications
In both academia and industry, peer-to-peer (P2P) applications have attracted great attention. Peer-to-peer file sharing applications, such as Napster, Gnutella, Kazaa, BitTorrent...
Jin Li
INFOCOM
2003
IEEE
15 years 8 months ago
Cooperation in Wireless Ad Hoc Networks
— In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the b...
Vikram Srinivasan, Pavan Nuggehalli, Carla-Fabiana...