187 search results - page 3 / 38 » Relaxed Alternating Projection Methods |
NA
2010
13 years 2 months ago
2010
A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed...
ECWEB
2010
Springer
13 years 5 months ago
2010
Springer
This research proposes a decision aid based on a novel type of preference relaxation, which enables consumers to easily make quality choices in online multiattribute choice scenari...
ICCAD
2004
IEEE
14 years 1 months ago
2004
IEEE
Abstract— This paper presents a post-route, timingconstrained gate-sizing algorithm for crosstalk reduction. Gate-sizing has emerged as a practical and feasible method to reduce ...
JAT
2006
13 years 4 months ago
2006
A new iterative method for finding the projection onto the intersection of two closed convex sets in a Hilbert space is presented. It is a Haugazeau-like modification of a recentl...
JMLR
2010
12 years 11 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...