Sciweavers

3082 search results - page 31 / 617
» New Bounds for the Controller Problem
Sort
View
105
Voted
CP
2008
Springer
15 years 5 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
148
Voted
ISCC
2005
IEEE
116views Communications» more  ISCC 2005»
15 years 9 months ago
Link Buffer Sizing: A New Look at the Old Problem
We revisit the question of how much buffer an IP router should allocate for its Droptail FIFO link. For a long time, setting the buffer size to the bitrate-delay product has been ...
Sergey Gorinsky, Anshul Kantawala, Jonathan S. Tur...
133
Voted
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
14 years 10 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner
120
Voted
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
16 years 16 days ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
130
Voted
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 3 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist