2899 search results - page 189 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
204
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
178
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
173
click to vote
EGH
2005
Springer
16 years 3 days ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
174
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
182
click to vote
TCAD
2008
15 years 6 months ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...