2520 search results - page 129 / 504 » The complexity of approximating entropy |
ATMOS
2007
15 years 2 days ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
117
click to vote
MST
2010
14 years 5 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
Significant power savings can be achieved on voltage/frequency configurable platforms by dynamically adapting the frequency and voltage according to the workload (complexity). Vid...
NN
2006
Springer
14 years 10 months ago
2006
Springer
We discuss an important property called the asymptotic equipartition property on empirical sequences in reinforcement learning. This states that the typical set of empirical seque...
JUCS
2002
14 years 10 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...