5169 search results - page 563 / 1034 » Locality approximation using time |
197
click to vote
JSAC
2006
15 years 7 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
195
click to vote
CGF
1998
15 years 7 months ago
1998
We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sourc...
211
click to vote
GLOBECOM
2010
IEEE
15 years 5 months ago
2010
IEEE
We investigate flow rate optimization on a wireless link with randomly varying channel gain using techniques from adaptive modulation and network utility maximization. We consider ...
198
click to vote
JMLR
2010
15 years 2 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
210
click to vote
AAAI
2012
13 years 9 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...