1007 search results - page 8 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
EUROMICRO
1998
IEEE
15 years 1 months ago
1998
IEEE
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
SPAA
2000
ACM
15 years 1 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
86
Voted
ICDE
2008
IEEE
15 years 3 months ago
2008
IEEE
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
151
click to vote
SCHEDULING
2011
14 years 4 months ago
2011
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
UAI
2000
14 years 10 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...