1477 search results - page 103 / 296 » Complexity of (iterated) dominance |
163
click to vote
SEKE
2004
Springer
15 years 11 months ago
2004
Springer
As application semantics becomes more complex and dynamic in IT systems, it is necessary to engineer the application semantics in its own lifecycle of development parallel to syste...
162
click to vote
NIPS
2004
15 years 7 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
145
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
220
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
146
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...