7150 search results - page 255 / 1430 » An Approximation Algorithm for Approximation Rank |
186
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
192
click to vote
WAOA
2007
Springer
16 years 22 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
157
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
219
click to vote
DAGSTUHL
1997
15 years 8 months ago
1997
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...
178
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...