4544 search results - page 378 / 909 » Reinforcement Learning with Time |
139
Voted
ESAS
2006
Springer
15 years 8 months ago
2006
Springer
We investigate the performance of of several protocol enhancements to the On-Demand Secure Byzantine Routing (ODSBR) [3] protocol in the presence of various Byzantine Attack models...
113
Voted
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
132
Voted
AAAI
2010
15 years 6 months ago
2010
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
152
click to vote
FLAIRS
2004
15 years 6 months ago
2004
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
155
click to vote
PAA
2008
15 years 4 months ago
2008
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...