330 search results - page 58 / 66 » Algorithms for Propositional Model Counting |
108
Voted
LOGCOM
1998
14 years 9 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...