1253 search results - page 130 / 251 » Convergence of Evolutionary Algorithms in General Search Spa... |
155
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
183
click to vote
ICTAI
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
164
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
180
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
163
click to vote
CPAIOR
2006
Springer
15 years 8 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...