270 search results - page 32 / 54 » Constraint relaxation in approximate linear programs |
90
Voted
JAIR
2010
14 years 11 months ago
2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
144
click to vote
ISPD
1997
ACM
15 years 4 months ago
1997
ACM
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...
97
Voted
ESOP
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
122
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
113
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...