Sciweavers

10901 search results - page 24 / 2181
» Approximations in Distributed Optimization
Sort
View
ISVC
2007
Springer
15 years 8 months ago
Image Compression Using Data-Dependent Triangulations
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided ...
Burkhard Lehner, Georg Umlauf, Bernd Hamann
PPAM
2005
Springer
15 years 8 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
15 years 12 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
IRREGULAR
1995
Springer
15 years 6 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
INFOCOM
2009
IEEE
15 years 9 months ago
Network Bandwidth Allocation via Distributed Auctions with Time Reservations
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
Pablo Belzarena, Andrés Ferragut, Fernando ...