Sciweavers

4865 search results - page 844 / 973
» The Complexity of Graph Connectivity
Sort
View
ORL
1998
68views more  ORL 1998»
14 years 9 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
SIAMAM
2010
119views more  SIAMAM 2010»
14 years 8 months ago
The Dynamics of Weakly Reversible Population Processes near Facets
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...
David F. Anderson, Anne Shiu
WIOPT
2010
IEEE
14 years 8 months ago
Hub-betweenness analysis in delay tolerant networks inferred by real traces
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
Giuliano Grossi, Federico Pedersini
BMCBI
2011
14 years 5 months ago
A lightweight, flow-based toolkit for parallel and distributed bioinformatics pipelines
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...
Marcin Cieslik, Cameron Mura
TSP
2010
14 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat