Sciweavers

4095 search results - page 305 / 819
» How to test a tree
Sort
View
134
Voted
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 25 days ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
115
Voted
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
14 years 10 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
UM
2007
Springer
15 years 7 months ago
The Effect of Model Granularity on Student Performance Prediction Using Bayesian Networks
A standing question in the field of Intelligent Tutoring Systems and User Modeling in general is what is the appropriate level of model granularity (how many skills to model) and h...
Zachary A. Pardos, Neil T. Heffernan, Brigham Ande...
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 5 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
NLP
2000
15 years 4 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman