575 search results - page 52 / 115 » Model Checking Restricted Sets of Timed Paths |
ICML
2009
IEEE
16 years 20 days ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
PET
2004
Springer
15 years 5 months ago
2004
Springer
Traditional methods for evaluating the amount of anonymity afforded by various Mix configurations have depended on either measuring the size of the set of possible senders of a p...
157
click to vote
ADHOC
2010
14 years 8 months ago
2010
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
104
click to vote
CGA
1999
14 years 11 months ago
1999
displays to abstract network data and let users interactwithit.Wehaveimplementedafull-scaleSwift3D prototype, which generated the examples we present here. Swift-3D We developed Sw...