Sciweavers

49 search results - page 7 / 10
» A fast polynomial time algorithm for logistics network flows
Sort
View
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
14 years 4 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
SIGOPS
2008
162views more  SIGOPS 2008»
13 years 7 months ago
CUBIC: a new TCP-friendly high-speed TCP variant
CUBIC is a congestion control protocol for TCP (transmission control protocol) and the current default TCP algorithm in Linux. The protocol modifies the linear window growth funct...
Sangtae Ha, Injong Rhee, Lisong Xu
MOR
2008
169views more  MOR 2008»
13 years 7 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna