Sciweavers

4066 search results - page 288 / 814
» Almost Complete Sets
Sort
View
IPPS
2002
IEEE
15 years 11 months ago
Parallel Out-of-Core Algorithm for Genome-Scale Enumeration of Metabolic Systemic Pathways
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...
Nagiza F. Samatova, Al Geist, George Ostrouchov, A...
COCO
2001
Springer
122views Algorithms» more  COCO 2001»
15 years 11 months ago
Hausdorff Dimension in Exponential Time
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, F...
LICS
2000
IEEE
15 years 11 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
ECOOP
1999
Springer
15 years 11 months ago
Inlining of Virtual Methods
We discuss aspects of inlining of virtual method invocations. First, we introduce a new method test to guard inlinings of such invocations, with a di erent set of tradeo s from the...
David Detlefs, Ole Agesen
ICLP
1997
Springer
15 years 10 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus