Sciweavers

909 search results - page 29 / 182
» On the approximability of some network design problems
Sort
View
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
15 years 5 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...
JORS
2011
67views more  JORS 2011»
14 years 8 months ago
Robust parameter design optimization of simulation experiments using stochastic perturbation methods
Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simula...
A. K. Miranda, E. Del Castillo
IPMU
2010
Springer
14 years 12 months ago
Approximation of Data by Decomposable Belief Models
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...
Radim Jirousek
ICALP
2004
Springer
15 years 6 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
UAI
2003
15 years 2 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin