2957 search results - page 154 / 592 » The Complexity of Polynomial-Time Approximation |
136
click to vote
WG
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
168
click to vote
COLT
2003
Springer
15 years 10 months ago
2003
Springer
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
139
Voted
DATE
1999
IEEE
15 years 9 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
184
click to vote
GRAPHICSINTERFACE
1997
15 years 6 months ago
1997
This paper presents a system for rendering very large collections of randomly parameterized plants while generating manageable scene geometries for rendering. A given botanical de...
134
Voted
ENTCS
2008
15 years 5 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...