Sciweavers

1165 search results - page 95 / 233
» Effective linear programming based placement methods
Sort
View
CDC
2010
IEEE
124views Control Systems» more  CDC 2010»
14 years 9 months ago
A relaxation of Lyapunov conditions and controller synthesis for discrete-time periodic systems
This paper proposes a novel approach to stability analysis and controller synthesis for discrete-time periodically time-varying systems. Firstly, a relaxation of standard Lyapunov ...
Christoph Bohm, Mircea Lazar, Frank Allgöwer
116
Voted
INFOCOM
2002
IEEE
15 years 7 months ago
Beyond Routing: An Algebraic Approach to Network Coding
Abstract— In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cut...
Muriel Médard, Ralf Koetter
154
Voted
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 6 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 12 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
ISQED
2007
IEEE
106views Hardware» more  ISQED 2007»
15 years 8 months ago
Passive Modeling of Interconnects by Waveform Shaping
In this paper, we propose a new approach to enforcing the passivity of a reduced system of general passive linear time invariant circuits. Instead of making the reduced models pas...
Boyuan Yan, Pu Liu, Sheldon X.-D. Tan, Bruce McGau...