2084 search results - page 291 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
132
click to vote
DAM
2006
15 years 2 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
147
Voted
SASO
2007
IEEE
15 years 8 months ago
2007
IEEE
A fundamental problem that confronts decentralized reputation systems is the design of efficient, secure and incentive-compatible mechanisms to gather trust information despite m...
118
click to vote
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
ANOR
2007
15 years 2 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
108
click to vote
PARLE
1991
15 years 6 months ago
1991
We present a new programming language designed to allow the convenient expression of algorithms for a parallel random access machine (PRAM). The language attempts to satisfy two p...