Sciweavers

2354 search results - page 318 / 471
» Tracking Stopping Times
Sort
View
AVI
2008
15 years 6 months ago
Timeline trees: visualizing sequences of transactions in information hierarchies
In many applications transactions between the elements of an information hierarchy occur over time. For example, the product offers of a department store can be organized into pro...
Michael Burch, Fabian Beck, Stephan Diehl
EDM
2008
193views Data Mining» more  EDM 2008»
15 years 5 months ago
Can we predict which groups of questions students will learn from?
In a previous study ([4]), we used the ASSISTment system to track student knowledge longitudinally over the course of a schools year, based upon each student using our system about...
Mingyu Feng, Neil T. Heffernan, Joseph E. Beck, Ke...
IJCAI
1989
15 years 5 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
JILP
2000
109views more  JILP 2000»
15 years 4 months ago
Dynamic Register Renaming Through Virtual-Physical Registers
Register file access time represents one of the critical delays of current microprocessors, and it is expected to become more critical as future processors increase the instructio...
Teresa Monreal, Antonio González, Mateo Val...
ICAI
2010
15 years 2 months ago
Constraint-Based Dogleg Channel Routing with Via Minimization
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
I-Lun Tseng, Huan-Wen Chen, Che-I Lee, Adam Postul...