Sciweavers

1542 search results - page 165 / 309
» Kernelization of packing problems
Sort
View
DAGSTUHL
2007
15 years 3 months ago
Learning Probabilistic Relational Dynamics for Multiple Tasks
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
Ashwin Deshpande, Brian Milch, Luke S. Zettlemoyer...
AAAI
2000
15 years 3 months ago
Sampling Methods for Action Selection in Influence Diagrams
Sampling has become an important strategy for inference in belief networks. It can also be applied to the problem of selecting actions in influence diagrams. In this paper, we pre...
Luis E. Ortiz, Leslie Pack Kaelbling
COLING
2000
15 years 3 months ago
Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
Miles Osborne
UAI
2000
15 years 3 months ago
Adaptive Importance Sampling for Estimation in Structured Domains
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
Luis E. Ortiz, Leslie Pack Kaelbling
103
Voted
JCO
2006
83views more  JCO 2006»
15 years 1 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt