5169 search results - page 382 / 1034 » Locality approximation using time |
187
click to vote
NECO
2007
15 years 6 months ago
2007
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
170
click to vote
GLVLSI
2010
IEEE
15 years 12 months ago
2010
IEEE
Processors have traditionally been designed for the worst-case, resulting in designs that have high yields, but are expensive in terms of area and power. Better-than-worst-case (B...
192
click to vote
SIGECOM
2003
ACM
16 years 2 days ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
192
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
182
click to vote
HASE
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a scalable, adaptive and timebounded general approach to assure reliable, real-time Node-Failure Detection (NFD) for large-scale, high load networks comprised ...