Sciweavers

16666 search results - page 2978 / 3334
» Descriptive and Computational Complexity
Sort
View
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 6 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
NECO
2002
145views more  NECO 2002»
15 years 6 months ago
Bayesian Model Assessment and Comparison Using Cross-Validation Predictive Densities
In this work, we discuss practical methods for the assessment, comparison, and selection of complex hierarchical Bayesian models. A natural way to assess the goodness of the model...
Aki Vehtari, Jouko Lampinen
NN
2002
Springer
122views Neural Networks» more  NN 2002»
15 years 6 months ago
Cellular, synaptic and network effects of neuromodulation
All network dynamics emerge from the complex interaction between the intrinsic membrane properties of network neurons and their synaptic connections. Nervous systems contain numer...
Eve Marder, Vatsala Thirumalai
PC
2002
137views Management» more  PC 2002»
15 years 6 months ago
The Chebyshev iteration revisited
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
Martin H. Gutknecht, Stefan Röllin
RAS
1998
145views more  RAS 1998»
15 years 6 months ago
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
Petr Svestka, Mark H. Overmars
« Prev « First page 2978 / 3334 Last » Next »