Sciweavers

1483 search results - page 1 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
CAD
1999
Springer
13 years 4 months ago
Geometric constraint satisfaction using optimization methods
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
Jian-Xin Ge, Shang-Ching Chou, Xiao-Shan Gao
DATE
2010
IEEE
129views Hardware» more  DATE 2010»
13 years 9 months ago
A power optimization method for CMOS Op-Amps using sub-space based geometric programming
—— A new sub-space max-monomial modeling scheme for CMOS transistors in sub-micron technologies is proposed to improve the modeling accuracy. Major electrical parameters of CMOS...
Wei Gao, Richard Hornsey
AAAI
2006
13 years 6 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack
ECAI
2000
Springer
13 years 9 months ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
CP
1995
Springer
13 years 8 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace