2924 search results - page 177 / 585 » Lower Bounds in Distributed Computing |
102
click to vote
SIGECOM
2004
ACM
15 years 6 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
106
click to vote
TAMC
2010
Springer
15 years 6 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
156
click to vote
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
104
click to vote
PAKDD
2009
ACM
15 years 5 months ago
2009
ACM
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...