2031 search results - page 170 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
A novel optimisation accelerator deploying neural network predictions and objective space direct manipulation strategies is presented. The concept of directing the search through ...
GECCO
2006
Springer
14 years 2 hour ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
JMLR
2010
13 years 3 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...