2233 search results - page 49 / 447 » On the Complexity of Theory Curbing |
123
click to vote
AMC
2007
15 years 2 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
104
click to vote
SAGT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
195
click to vote
ICAART
2010
INSTICC
15 years 11 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
129
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
105
click to vote
ICALP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...