1063 search results - page 165 / 213 » Combining Simple Models to Approximate Complex Dynamics |
IPPS
1998
IEEE
14 years 3 months ago
1998
IEEE
Abstract. The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applicatio...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
PE
2002
Springer
13 years 10 months ago
2002
Springer
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server...
SMA
2010
ACM
13 years 11 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
RECOMB
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We describe a probabilistic model, implemented as a dynamic Bayesian network, that can be used to predict nucleosome positioning along a chromosome based on one or more g...