Sciweavers

48 search results - page 4 / 10
» Random Test Run Length and Effectiveness
Sort
View
SAT
2004
Springer
102views Hardware» more  SAT 2004»
14 years 21 days ago
Derandomization of Schuler's Algorithm for SAT
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
Evgeny Dantsin, Alexander Wolpert
IJCAI
2007
13 years 8 months ago
Nogood Recording from Restarts
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
ITS
2010
Springer
178views Multimedia» more  ITS 2010»
14 years 4 days ago
Learning What Works in ITS from Non-traditional Randomized Controlled Trial Data
The traditional, well established approach to finding out what works in education research is to run a randomized controlled trial (RCT) using a standard pretest and posttest desig...
Zachary A. Pardos, Matthew D. Dailey, Neil T. Heff...
ICMCS
2007
IEEE
143views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Hidden Conditional Random Fields for Meeting Segmentation
Automatic segmentation and classification of recorded meetings provides a basis towards understanding the content of a meeting. It enables effective browsing and querying in a me...
Stephan Reiter, Björn Schuller, Gerhard Rigol...
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 5 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan