176 search results - page 3 / 36 » A Clustering Approach to Solving Large Stochastic Matching P... |
AAAI
2010
13 years 4 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
TRANSCI
2010
13 years 2 months ago
2010
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
SIAMJO
2002
13 years 7 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
TON
2010
13 years 5 months ago
2010
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...