7129 search results - page 286 / 1426 » Approximation Algorithms for Treewidth |
112
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
150
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
177
click to vote
PG
2007
IEEE
15 years 10 months ago
2007
IEEE
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
121
click to vote
CONIELECOMP
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a wavelet neural-network for learning and approximation of chaotic time series. Wavelet-networks are inspired by both feed-forward neural networks and the theo...
149
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...