536 search results - page 23 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
AAAI
1997
13 years 9 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
EDBTW
2010
Springer
14 years 3 months ago
2010
Springer
To face the increasing demand from users, National Statistical Institutes (NSI) release different information products. The dissemination of this information should be performed ...
COCO
1993
Springer
14 years 17 days ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
PAMI
2002
13 years 8 months ago
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
WDAG
2009
Springer
14 years 3 months ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...