2031 search results - page 58 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
AAAI
2007
13 years 10 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
COR
2007
13 years 7 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
CEC
2011
IEEE
12 years 8 months ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...