Sciweavers

1155 search results - page 148 / 231
» Continuous dynamic problem generators for evolutionary algor...
Sort
View
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 2 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
15 years 4 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
WCRE
2002
IEEE
15 years 7 months ago
Register Liveness Analysis for Optimizing Dynamic Binary Translation
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
Mark Probst, Andreas Krall, Bernhard Scholz
JMLR
2010
140views more  JMLR 2010»
14 years 9 months ago
Learning Non-Stationary Dynamic Bayesian Networks
Learning dynamic Bayesian network structures provides a principled mechanism for identifying conditional dependencies in time-series data. An important assumption of traditional D...
Joshua W. Robinson, Alexander J. Hartemink
STACS
2007
Springer
15 years 9 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura