Sciweavers

2503 search results - page 426 / 501
» A study of 3-arc graphs
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
IPSN
2004
Springer
14 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
OOPSLA
2004
Springer
14 years 3 months ago
Method-level phase behavior in java workloads
Java workloads are becoming more and more prominent on various computing devices. Understanding the behavior of a Java workload which includes the interaction between the applicat...
Andy Georges, Dries Buytaert, Lieven Eeckhout, Koe...
APSEC
2003
IEEE
14 years 3 months ago
Understanding How the Requirements Are Implemented in Source Code
For software maintenance and evolution, a common problem is to understand how each requirement is implemented in the source code. The basic solution of this problem is to find the...
Wei Zhao, Lu Zhang, Yin Liu, Jing Luo, Jiasu Sun
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
14 years 3 months ago
A Computational Approach to Reconstructing Gene Regulatory Networks
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
Xutao Deng, Hesham H. Ali