Sciweavers

2520 search results - page 201 / 504
» The complexity of approximating entropy
Sort
View
203
Voted
ICML
2003
IEEE
15 years 11 months ago
The Significance of Temporal-Difference Learning in Self-Play Training TD-Rummy versus EVO-rummy
Reinforcement learning has been used for training game playing agents. The value function for a complex game must be approximated with a continuous function because the number of ...
Clifford Kotnik, Jugal K. Kalita
KR
1992
Springer
15 years 10 months ago
Order of Magnitude Reasoning using Logarithms
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
P. Pandurang Nayak
APN
2006
Springer
15 years 9 months ago
A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
Serge Haddad, Lynda Mokdad, Patrice Moreaux
WSC
2007
15 years 8 months ago
Path-sampling for state-dependent importance sampling
State-dependent importance sampling (SDIS) has proved to be particularly useful in simulation (specially in rare event analysis of stochastic systems). One approach for designing ...
Jose H. Blanchet, Jingchen Liu
CP
2008
Springer
15 years 7 months ago
Length-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Ho...