Sciweavers

4524 search results - page 208 / 905
» The Complexity of Global Constraints
Sort
View
DAC
2004
ACM
16 years 7 months ago
Automated design of operational transconductance amplifiers using reversed geometric programming
We present a method for designing operational amplifiers using reversed geometric programming, which is an extension of geometric programming that allows both convex and non-conve...
Johan P. Vanderhaegen, Robert W. Brodersen
AIMSA
2008
Springer
16 years 1 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek
CP
2007
Springer
16 years 25 days ago
Breaking Symmetry of Interchangeable Variables and Values
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, J. Y. ...
FLAIRS
2008
15 years 9 months ago
Reasoning with Conditional Time-Intervals
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
Philippe Laborie, Jerome Rogerie
ICASSP
2011
IEEE
14 years 10 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan