Sciweavers

2694 search results - page 260 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
MSOM
2008
103views more  MSOM 2008»
15 years 6 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
PVM
2004
Springer
15 years 12 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
HPDC
2006
IEEE
16 years 17 days ago
Replicating Nondeterministic Services on Grid Environments
Replication is a technique commonly used to increase the availability of services in distributed systems, including grid and web services. While replication is relatively easy for...
Xianan Zhang, Flavio Junqueira, Matti A. Hiltunen,...
CEC
2007
IEEE
16 years 26 days ago
A Utile Function Optimizer
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
Christopher K. Monson, Kevin D. Seppi, James L. Ca...
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 8 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi