2031 search results - page 69 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
CSC
2009
13 years 9 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...