Sciweavers

493 search results - page 54 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
ICDCS
2009
IEEE
14 years 6 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
WLP
2004
Springer
14 years 2 months ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
Misa Keinänen, Ilkka Niemelä
ACL
2006
13 years 10 months ago
Novel Association Measures Using Web Search with Double Checking
A web search with double checking model is proposed to explore the web as a live corpus. Five association measures including variants of Dice, Overlap Ratio, Jaccard, and Cosine, ...
Hsin-Hsi Chen, Ming-Shun Lin, Yu-Chuan Wei
JSW
2007
156views more  JSW 2007»
13 years 8 months ago
An Automatic Test Case Generation Framework for Web Services
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...
Yongyan Zheng, Jiong Zhou, Paul Krause
ICALP
2007
Springer
14 years 3 months ago
Checking and Spot-Checking the Correctness of Priority Queues
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
Matthew Chu, Sampath Kannan, Andrew McGregor