Sciweavers

1516 search results - page 49 / 304
» The Increasing Nvalue Constraint
Sort
View
ICML
2006
IEEE
15 years 10 months ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert
HICSS
2003
IEEE
85views Biometrics» more  HICSS 2003»
15 years 3 months ago
Designs for Ramp-Constrained Day-Ahead Auctions
— Some electric power markets allow bidders to specify constraints on ramp rates for increasing or decreasing power production. We show in a small example that a bidder could use...
Shmuel S. Oren, Andrew M. Ross
ICCAD
2002
IEEE
89views Hardware» more  ICCAD 2002»
15 years 2 months ago
Free space management for cut-based placement
IP blocks and large macro cells are increasingly prevalent in physical design, actually causing an increase in the available free space for the dust logic. We observe that top-dow...
Charles J. Alpert, Gi-Joon Nam, Paul Villarrubia
CSCLP
2006
Springer
15 years 1 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
DAC
2004
ACM
15 years 10 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