Sciweavers

5595 search results - page 17 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
91
Voted
MOR
2006
90views more  MOR 2006»
14 years 11 months ago
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani
ACSAC
2001
IEEE
15 years 3 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch
79
Voted
AAMAS
2007
Springer
14 years 11 months ago
Parallel Reinforcement Learning with Linear Function Approximation
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Matthew Grounds, Daniel Kudenko
186
Voted
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 1 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove