2031 search results - page 95 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
ASPDAC
2007
ACM
14 years 4 days ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
NIPS
2004
13 years 9 months ago
2004
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— The Particle Swarm Optimization (PSO) algorithm is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper p...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...