Sciweavers

806 search results - page 16 / 162
» Lower Bounds on Correction Networks
Sort
View
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 7 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
ALT
2010
Springer
13 years 9 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
DSN
2006
IEEE
14 years 1 months ago
Automatic Recovery Using Bounded Partially Observable Markov Decision Processes
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
Kaustubh R. Joshi, William H. Sanders, Matti A. Hi...
CORR
2007
Springer
137views Education» more  CORR 2007»
13 years 7 months ago
Bounds on the Network Coding Capacity for Wireless Random Networks
— Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic mode...
Salah A. Aly, Vishal Kapoor, Jie Meng, Andreas Kla...
ESOP
2003
Springer
14 years 26 days ago
Requirements on the Execution of Kahn Process Networks
Kahn process networks (KPNs) are a programming paradigm suitable for streaming-based multimedia and signal-processing applications. We discuss the execution of KPNs, and the criter...
Marc Geilen, Twan Basten