Sciweavers

274 search results - page 22 / 55
» Learning decision trees from dynamic data streams
Sort
View
IDA
2002
Springer
13 years 7 months ago
Online classification of nonstationary data streams
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
Mark Last
ICML
2010
IEEE
13 years 8 months ago
Detecting Large-Scale System Problems by Mining Console Logs
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many sof...
Wei Xu, Ling Huang, Armando Fox, David Patterson, ...
ICNP
2003
IEEE
14 years 28 days ago
Resilient Peer-to-Peer Streaming
We consider the problem of distributing “live” streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attr...
Venkata N. Padmanabhan, Helen J. Wang, Philip A. C...
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 7 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
ICML
2007
IEEE
14 years 8 months ago
Percentile optimization in uncertain Markov decision processes with application to efficient exploration
Markov decision processes are an effective tool in modeling decision-making in uncertain dynamic environments. Since the parameters of these models are typically estimated from da...
Erick Delage, Shie Mannor