1142 search results - page 85 / 229 » Approximability of Clausal Constraints |
180
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
171
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
160
click to vote
MP
1998
15 years 6 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
166
click to vote
NIPS
2004
15 years 7 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
146
click to vote
SIAMJO
2010
15 years 1 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...