Sciweavers

676 search results - page 41 / 136
» Fixed-Parameter Approximation: Conceptual Framework and Appr...
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
AAAI
2010
13 years 9 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
ACL
2007
13 years 9 months ago
Constituent Parsing with Incremental Sigmoid Belief Networks
We introduce a framework for syntactic parsing with latent variables based on a form of dynamic Sigmoid Belief Networks called Incremental Sigmoid Belief Networks. We demonstrate ...
Ivan Titov, James Henderson
CORR
2002
Springer
132views Education» more  CORR 2002»
13 years 7 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter
AAAI
2012
11 years 10 months ago
Kernel-Based Reinforcement Learning on Representative States
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
Branislav Kveton, Georgios Theocharous