Sciweavers

135 search results - page 2 / 27
» Properties of tree convex constraints
Sort
View
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
13 years 9 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
IJCAI
2003
13 years 6 months ago
Consistency and Set Intersection
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
Yuanlin Zhang, Roland H. C. Yap
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
13 years 3 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani
DCG
1999
81views more  DCG 1999»
13 years 5 months ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
SIAMJO
2002
88views more  SIAMJO 2002»
13 years 5 months ago
Subdifferential Conditions for Calmness of Convex Constraints
We study subdifferential conditions of the calmness property for multifunctions representing convex constraint systems in a Banach space. Extending earlier work in finite dimension...
René Henrion, Abderrahim Jourani