1095 search results - page 36 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
146
Voted
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
146
Voted
ICCD
2006
IEEE
16 years 26 days ago
2006
IEEE
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
141
click to vote
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
98
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
169
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...