914 search results - page 157 / 183 » Branch and Bound on the Network Model |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
AUTOMATICA
2010
13 years 5 months ago
2010
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
DAC
2000
ACM
14 years 8 months ago
2000
ACM
We revisit a basic element of modern signal integrity analysis, the modeling of worst-case coupling capacitance effects within a switch factor (SF) based methodology. We show that...
CCCG
2008
13 years 9 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
JEC
2006
13 years 7 months ago
2006
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...