2182 search results - page 277 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
113
click to vote
AAECC
1999
Springer
15 years 2 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
144
Voted
SWAT
2010
Springer
15 years 13 days ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
139
click to vote
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
197
Voted
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
The reward functions that drive reinforcement learning systems are generally derived directly from the descriptions of the problems that the systems are being used to solve. In so...
117
Voted
APLAS
2000
ACM
15 years 7 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...