219 search results - page 6 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
ISPAN
2002
IEEE
14 years 1 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
JCSS
2000
13 years 8 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
RAS
2007
13 years 8 months ago
2007
In free-floating mode, space manipulator systems have their actuators turned off, and exhibit nonholonomic behavior due to angular momentum conservation. The system is underactua...
WDAG
2007
Springer
14 years 2 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
SPAA
1995
ACM
14 years 4 days ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...