2976 search results - page 228 / 596 » On the bounded integer programming |
179
click to vote
EUROGP
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on ...
158
click to vote
MP
2006
15 years 6 months ago
2006
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
136
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
180
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
173
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...