Sciweavers

4544 search results - page 711 / 909
» Reinforcement Learning with Time
Sort
View
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
15 years 11 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
SAT
2009
Springer
132views Hardware» more  SAT 2009»
15 years 11 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman
HPCA
2008
IEEE
15 years 11 months ago
Prediction of CPU idle-busy activity pattern
Real-world workloads rarely saturate multi-core processor. CPU C-states can be used to reduce power consumption during processor idle time. The key unsolved problem is: when and h...
Qian Diao, Justin J. Song
ICDM
2008
IEEE
145views Data Mining» more  ICDM 2008»
15 years 11 months ago
Paired Learners for Concept Drift
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
Stephen H. Bach, Marcus A. Maloof
ISDA
2008
IEEE
15 years 11 months ago
Genetic Annealing Optimization: Design and Real World Applications
Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA mainta...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...