Sciweavers

6601 search results - page 153 / 1321
» Optimal Distributed Arc-Consistency
Sort
View
TON
2010
136views more  TON 2010»
13 years 3 months ago
Distributed Opportunistic Scheduling With Two-Level Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
TSP
2010
13 years 3 months ago
Distributed learning in multi-armed bandit with multiple players
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
Keqin Liu, Qing Zhao
IPPS
2003
IEEE
14 years 2 months ago
A Characterisation of Optimal Channel Assignments for Wireless Networks Modelled as Cellular and Square Grids
In this paper we first present a uniformity property that characterises optimal channel assignments for networks arranged as cellular or square grids. Then, we present optimal ch...
Madhusudana V. S. Shashanka, Amrita Pati, Anil M. ...
IPPS
1999
IEEE
14 years 1 months ago
Optimization Rules for Programming with Collective Operations
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a fo...
Sergei Gorlatch, Christoph Wedler, Christian Lenga...
COCO
1995
Springer
134views Algorithms» more  COCO 1995»
14 years 23 days ago
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
Rainer Schuler, Osamu Watanabe