49 search results - page 2 / 10 » A fast polynomial time algorithm for logistics network flows |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
NCA
2008
IEEE
13 years 7 months ago
2008
IEEE
Motivated by the slow learning properties of multilayer perceptrons (MLPs) which utilize computationally intensive training algorithms, such as the backpropagation learning algorit...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
NETWORKS
2011
13 years 2 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...