Sciweavers

330 search results - page 24 / 66
» Algorithms for Propositional Model Counting
Sort
View
AIPS
2011
14 years 1 months ago
Planning and Acting in Incomplete Domains
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
Christopher Weber, Daniel Bryce
BMCBI
2006
151views more  BMCBI 2006»
14 years 9 months ago
Modeling Sage data with a truncated gamma-Poisson model
Background: Serial Analysis of Gene Expressions (SAGE) produces gene expression measurements on a discrete scale, due to the finite number of molecules in the sample. This means t...
Helene H. Thygesen, Aeilko H. Zwinderman
STACS
2007
Springer
15 years 3 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
DCC
2003
IEEE
15 years 9 months ago
PPM Model Cleaning
The Prediction by Partial Matching (PPM) algorithm uses a cumulative frequency count of input symbols in different contexts to estimate their probability distribution. Excellent c...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
14 years 11 months ago
Efficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...