Sciweavers

1068 search results - page 150 / 214
» Extremely randomized trees
Sort
View
DATE
2010
IEEE
161views Hardware» more  DATE 2010»
14 years 3 months ago
BISD: Scan-based Built-In self-diagnosis
Abstract—Built-In Self-Test (BIST) is less often applied to random logic than to embedded memories due to the following reasons: Firstly, for a satisfiable fault coverage it may...
Melanie Elm, Hans-Joachim Wunderlich
AI
1998
Springer
14 years 2 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
RIDE
1997
IEEE
14 years 2 months ago
Evaluation of Sampling for Data Mining of Association Rules
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
14 years 1 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova
AAAI
2008
14 years 9 days ago
Adaptive Treatment of Epilepsy via Batch-mode Reinforcement Learning
This paper highlights the crucial role that modern machine learning techniques can play in the optimization of treatment strategies for patients with chronic disorders. In particu...
Arthur Guez, Robert D. Vincent, Massimo Avoli, Joe...