Sciweavers

272 search results - page 6 / 55
» Dependability Analysis: A New Application for Run-Time Recon...
Sort
View
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 7 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
OSDI
2008
ACM
14 years 7 months ago
Automating Network Application Dependency Discovery: Experiences, Limitations, and New Solutions
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
Xu Chen, Ming Zhang, Zhuoqing Morley Mao, Paramvir...
ECRTS
2004
IEEE
13 years 11 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
EVOW
2008
Springer
13 years 9 months ago
Analysis of Reconfigurable Logic Blocks for Evolvable Digital Architectures
Abstract. In this paper we propose three small instances of a reconfigurable circuit and analyze their properties using the brute force method and evolutionary algorithm. Although ...
Lukás Sekanina, Petr Mikusek
PPOPP
1991
ACM
13 years 11 months ago
Dynamic Node Reconfiguration in a Parallel-Distributed Environment
Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the netwo...
Michael J. Feeley, Brian N. Bershad, Jeffrey S. Ch...