Sciweavers

438 search results - page 28 / 88
» On Perfect Switching Classes
Sort
View
AUTOMATICA
2007
142views more  AUTOMATICA 2007»
13 years 8 months ago
Lyapunov-based switching control of nonlinear systems using high-gain observers
Abstract— We consider dynamic output feedback practical stabilization of uniformly observable nonlinear systems, based on high-gain observers with saturation. We assume that unce...
Leonid B. Freidovich, Hassan K. Khalil
INFOCOM
2010
IEEE
13 years 7 months ago
Twister Networks and Their Applications to Load-Balanced Switches
Abstract—Inspired by the recent development of optical queueing theory, in this paper we study a class of multistage interconnection networks (MINs), called twister networks. Unl...
Ching-Ming Lien, Cheng-Shang Chang, Jay Cheng, Dua...
ICN
2005
Springer
14 years 2 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
14 years 27 days ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
TSP
2010
13 years 3 months ago
Sampling piecewise sinusoidal signals with finite rate of innovation methods
We consider the problem of sampling piecewise sinusoidal signals. Classical sampling theory does not enable perfect reconstruction of such signals since they are not bandlimited. ...
Jesse Berent, Pier Luigi Dragotti, Thierry Blu