Sciweavers

CCR
2005
96views more  CCR 2005»
13 years 4 months ago
Stability of end-to-end algorithms for joint routing and rate control
Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve...
Frank P. Kelly, Thomas Voice
TODAES
2008
47views more  TODAES 2008»
13 years 4 months ago
A tool for automatic detection of deadlock in wormhole networks on chip
We present an extension of Duato's necessary and sufficient condition a routing function must satisfy in order to be deadlock-free, to support environment constraints inducing...
Sami Taktak, Jean Lou Desbarbieux, Emmanuelle Encr...
AUTOMATICA
2005
95views more  AUTOMATICA 2005»
13 years 4 months ago
A note on asymptotic stabilization of linear systems by periodic, piecewise constant, output feedback
This note studies the asymptotic stabilization problem for controllable and observable, single-input single-output, linear, time-invariant, continuous-time systems by means of mem...
J. C. Allwright, Alessandro Astolfi, H. P. Wong
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 4 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read
ALIFE
2005
13 years 4 months ago
State Aggregation and Population Dynamics in Linear Systems
We consider complex systems that are composed of many interacting elements, evolving under some dynamics. We are interested in characterizing the ways in which these elements may b...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
SIAMCO
2008
52views more  SIAMCO 2008»
13 years 4 months ago
Stability of Solutions for Some Classes of Nonlinear Damped Wave Equations
We consider two classes of semilinear wave equations with nonnegative damping which may be of type "on
Genni Fragnelli, Dimitri Mugnai
SIAMAM
2008
97views more  SIAMAM 2008»
13 years 4 months ago
Convergence of Dual Algorithm with Arbitrary Communication Delays
We study the issue of convergence of user rates and resource prices under a family of rate control schemes called dual algorithms with arbitrary communication delays. We first con...
Richard J. La, Priya Ranjan
MST
2008
80views more  MST 2008»
13 years 4 months ago
A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange
Abstract The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards...
Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
EJC
2006
13 years 4 months ago
Homomorphism bounded classes of graphs
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
Timothy Marshall, Reza Nasraser, Jaroslav Nesetril
DM
2006
54views more  DM 2006»
13 years 4 months ago
A note on interconnecting matchings in graphs
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
Tomás Kaiser