Sciweavers

2925 search results - page 413 / 585
» Information Complexity of Online Problems
Sort
View
AIEDU
2005
106views more  AIEDU 2005»
15 years 4 months ago
A Comparison of Model-Tracing and Constraint-Based Intelligent Tutoring Paradigms
Two approaches to building intelligent tutoring systems are the well-established model-tracing paradigm and the relatively newer constraint-based paradigm. Proponents of the constr...
Viswanathan Kodaganallur, Rob R. Weitz, David Rose...
VLSISP
2002
123views more  VLSISP 2002»
15 years 4 months ago
Monte Carlo Bayesian Signal Processing for Wireless Communications
Abstract. Many statistical signal processing problems found in wireless communications involves making inference about the transmitted information data based on the received signal...
Xiaodong Wang, Rong Chen, Jun S. Liu
MFCS
2010
Springer
15 years 2 months ago
Qualitative Analysis of Partially-Observable Markov Decision Processes
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ACMSE
2010
ACM
14 years 11 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 6 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko