Sciweavers

2887 search results - page 80 / 578
» Name Generation and Linearity
Sort
View
DAC
1998
ACM
15 years 10 months ago
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device model...
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov
CDC
2010
IEEE
125views Control Systems» more  CDC 2010»
15 years 1 months ago
Towards robust Lie-algebraic stability conditions for switched linear systems
This paper presents new sufficient conditions for exponential stability of switched linear systems under arbitrary switching, which involve the commutators (Lie brackets) among the...
Andrei A. Agrachev, Yuliy Baryshnikov, Daniel Libe...
COR
2008
118views more  COR 2008»
15 years 6 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
EOR
2006
91views more  EOR 2006»
15 years 6 months ago
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
A. Miguel Gomes, José F. Oliveira
TIT
1998
158views more  TIT 1998»
15 years 5 months ago
Modulation and Coding for Linear Gaussian Channels
—Shannon’s determination of the capacity of the linear Gaussian channel has posed a magnificent challenge to succeeding generations of researchers. This paper surveys how this...
G. David Forney Jr., Gottfried Ungerboeck