158 search results - page 22 / 32 » Randomized Shared Queues Applied to Distributed Optimization... |
APPROX
2005
Springer
14 years 28 days ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
AUTOMATICA
2006
13 years 7 months ago
2006
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
JAIR
2007
13 years 7 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
IOPADS
1997
13 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
CP
2003
Springer
14 years 18 days ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...