2543 search results - page 154 / 509 » Optimal Ordered Problem Solver |
131
click to vote
JSAT
2006
15 years 3 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
129
click to vote
EOR
2007
15 years 3 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
113
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
127
click to vote
NIPS
1993
15 years 4 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
132
Voted
SODA
2010
ACM
16 years 19 days ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...