Sciweavers

3019 search results - page 81 / 604
» Approximating the Domatic Number
Sort
View
DISOPT
2010
132views more  DISOPT 2010»
14 years 12 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
15 years 2 days ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
15 years 5 months ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
ICIAR
2010
Springer
15 years 4 months ago
Structural Similarity-Based Approximation of Signals and Images Using Orthogonal Bases
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
Dominique Brunet, Edward R. Vrscay, Zhou Wang