674 search results - page 12 / 135 » The computational complexity of the parallel knock-out probl... |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
GRID
2000
Springer
13 years 11 months ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...
EUROPAR
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many fu...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...