330 search results - page 34 / 66 » Algorithms for Propositional Model Counting |
227
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
134
click to vote
AAAI
2012
13 years 4 months ago
2012
Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
145
click to vote
IGPL
2006
15 years 2 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
156
click to vote
CASES
2004
ACM
15 years 7 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
126
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...