Sciweavers

6693 search results - page 279 / 1339
» On an anytime algorithm for control
Sort
View
157
Voted
AUTOMATICA
2007
84views more  AUTOMATICA 2007»
15 years 6 months ago
Nonsmooth optimization for multiband frequency domain control design
Multiband frequency domain synthesis consists in the minimization of a finite family of closed-loop transfer functions on prescribed frequency intervals. This is an algorithmical...
Pierre Apkarian, Dominikus Noll
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
15 years 6 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene
ICASSP
2011
IEEE
14 years 10 months ago
Max-min fair rate control based on a saddle-point characterization of some perron roots
We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter-receiver pairs) are subject to general constrain...
Slawomir Stanczak, Michal Kaliszan, Mario Goldenba...
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
15 years 10 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 7 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...