438 search results - page 74 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
142
Voted
EMSOFT
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...
137
Voted
PODS
2007
ACM
16 years 2 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
129
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
129
Voted
SIGECOM
2008
ACM
15 years 2 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
122
Voted
ICFP
2004
ACM
16 years 2 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...