fall-2001-04
Contents
Optimal Schedules for Parallelizing Anytime Algorithms
PDFReasoning across Scenarios in Planning under Uncertainty
PDFHandling Uncertainty with Active Logic
PDFFormal Models of Heavy-Tailed Behavior in Combinatorial Search
PDFUsing Prior Knowledge with Adaptive Probing
PDFYet Another Local Search Method for Constraint Solving
PDFApproximate and Compensate: A Method for Risk-Sensitive Meta-Deliberation and Continual Computation
PDFModeling Unpredictable or Random Environments
PDFA Bayesian Approach to Tackling Hard Computational Problems
PDFUsing Uncertainty Within Computation
PDFSelecting the Right Algorithm
PDFMethods for Sampling Pages Uniformly from the World Wide Web
PDFPlanning under Uncertainty via Stochastic Satisfiability
PDFScheduling Contract Algorithms on Multiple Processors
PDFBayesian Networks for Logical Reasoning
PDFFirst-Order Markov Decision Processes
PDFLocal Search and Backtracking vs. Non-Systematic Backtracking
PDFOn Retaining Intermediate Probabilistic Models When Building Bayesian Networks
PDFData Uncertainty in Constraint Programming: A Non-Probabilistic Approach
PDFTwo Algorithms for Learning the Parameters of Stochastic Context-Free Grammars
PDFTemporal Update Mechanisms for Decision Making with Aging Observations in Probabilistic Networks
PDFUnrestricted Backtracking Algorithms for Satisfiability
PDFStochastic Constraint Programming
PDF