6437 search results - page 541 / 1288 » Parallel Algorithms for Arrangements |
198
click to vote
IPPS
2003
IEEE
16 years 3 days ago
2003
IEEE
High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because n...
185
Voted
SPAA
2003
ACM
16 years 2 days ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
158
click to vote
SSDBM
2010
IEEE
15 years 12 months ago
2010
IEEE
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
192
click to vote
IEEEPACT
2000
IEEE
15 years 11 months ago
2000
IEEE
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
228
click to vote
SPAA
1996
ACM
15 years 11 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...