Sciweavers

901 search results - page 11 / 181
» Analyzing linear mergers
Sort
View
COR
2004
291views more  COR 2004»
13 years 8 months ago
Cycling in linear programming problems
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
Saul I. Gass, Sasirekha Vinjamuri
HYBRID
2005
Springer
14 years 2 months ago
Observability of Switched Linear Systems in Continuous Time
Abstract. We study continuous-time switched linear systems with unobserved and exogenous mode signals. We analyze the observability of the initial state and initial mode under arbi...
Mohamed Babaali, George J. Pappas
AUTOMATICA
2006
68views more  AUTOMATICA 2006»
13 years 8 months ago
State and unknown input estimation for linear discrete-time systems
: This paper deals with a new type of estimator for discrete-time linear systems with unknown inputs. A constructive algorithm is given in order to analyze the state observability ...
Thierry Floquet, Jean-Pierre Barbot
INFOCOM
1997
IEEE
14 years 20 days ago
A Linear Control Approach to Explicit Rate Feedback in ATM Networks
Rate-based feedback congestion control has been proposed as a form of traffic management for available bit rate traffic in ATM networks. This paper discusses applying linear con...
Charles E. Rohrs, Randall A. Berry
APPML
2005
56views more  APPML 2005»
13 years 8 months ago
On the semigroup of linearized forced elongation
In this note we analyze the linearized equations of forced elongation. We prove that solutions of these equations are given by a quasicontraction C0-semigroup on the physically co...
Thomas Hagen