2084 search results - page 353 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
153
Voted
SIGMETRICS
2009
ACM
15 years 9 months ago
2009
ACM
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
121
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
101
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
152
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
121
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college st...