Sciweavers

1201 search results - page 216 / 241
» Linear Probing and Graphs
Sort
View
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
13 years 11 months ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....
EJC
2006
13 years 11 months ago
The positive Bergman complex of an oriented matroid
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
Federico Ardila, Caroline J. Klivans, Lauren Willi...
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 11 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signi...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 11 months ago
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
Junsheng Han, Paul H. Siegel, Ron M. Roth
JCO
2006
126views more  JCO 2006»
13 years 11 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...