176 search results - page 22 / 36 » Estimating the size of the solution space of metabolic netwo... |
JSA
2000
13 years 8 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
AI
2011
Springer
13 years 3 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
—Enhanced network services often involve allocating resources (bandwidth/buffer space) preferentially to packets belonging to certain flows or traffic classes. Such services ar...