Sciweavers

43264 search results - page 8314 / 8653
» Comparing models of computation
Sort
View
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 2 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
PC
1998
101views Management» more  PC 1998»
15 years 2 months ago
Performing Out-of Core FFTs on Parallel Disk Systems
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
Thomas H. Cormen, David M. Nicol
RAS
2002
247views more  RAS 2002»
15 years 2 months ago
Reference scan matching for global self-localization
Especially in dynamic environments a key feature concerning the robustness of mobile robot navigation is the capability of global self-localization. This term denotes a robot'...
Joachim Weber, Lutz Franken, Klaus-Werner Jör...
SIGMETRICS
1998
ACM
15 years 2 months ago
Internet service performance failure detection
The increasing complexity of computer networks and our increasing dependence on them means enforcing reliability requirements is both more challenging and more critical. The expan...
Amy R. Ward, Peter W. Glynn, Kathy J. Richardson
STTT
1998
130views more  STTT 1998»
15 years 2 months ago
The Practitioner's Guide to Coloured Petri Nets
Abstract. Coloured Petri nets (CP-nets or CPNs) provide a framework for the design, specification, validation, and verification of systems. CP-nets have a wide range of applicati...
Lars Michael Kristensen, Søren Christensen,...
« Prev « First page 8314 / 8653 Last » Next »