Sciweavers

1142 search results - page 99 / 229
» Approximability of Clausal Constraints
Sort
View
SIAMJO
2000
88views more  SIAMJO 2000»
15 years 6 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
PODS
2010
ACM
197views Database» more  PODS 2010»
15 years 6 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
GECCO
2009
Springer
16 years 1 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 12 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 10 months ago
Epsilon-constraint with an efficient cultured differential evolution
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
Ricardo Landa Becerra, Carlos A. Coello Coello