358 search results - page 56 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
117
click to vote
HIPC
2003
Springer
15 years 7 months ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
103
Voted
ICRA
2010
IEEE
15 years 12 days ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
100
Voted
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
As the number of cores continues to grow in both digital signal and general purpose processors, tools which perform automatic scheduling from model-based designs are of increasing...
184
Voted
ICDCS
2012
IEEE
13 years 4 months ago
2012
IEEE
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
146
Voted
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...