Sciweavers

1279 search results - page 108 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
AINA
2007
IEEE
14 years 3 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
AAAI
2012
11 years 11 months ago
Prediction and Fault Detection of Environmental Signals with Uncharacterised Faults
Many signals of interest are corrupted by faults of an unknown type. We propose an approach that uses Gaussian processes and a general “fault bucket” to capture a priori uncha...
Michael A. Osborne, Roman Garnett, Kevin Swersky, ...
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 3 months ago
On optimal cooperative patrolling
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
CORR
2006
Springer
140views Education» more  CORR 2006»
13 years 9 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis
IWLCS
2005
Springer
14 years 2 months ago
Counter Example for Q-Bucket-Brigade Under Prediction Problem
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
Atsushi Wada, Keiki Takadama, Katsunori Shimohara