86 search results - page 2 / 18 » Satisfiability Algorithms and Finite Quantification |
HPCC
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Energy consumption is a major factor that limits the performance of sensor applications. Sensor nodes have varying sampling rates since they face continuously changing en...
WAIM
2005
Springer
13 years 10 months ago
2005
Springer
This paper analyzes the simulation of Finite State mobile agent, which regards the migration, execution, and searching of the mobile agents as finite states. As the finite state mo...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
CAV
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
PODS
2004
ACM
14 years 5 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...