Sciweavers

1830 search results - page 215 / 366
» Workshop on Graph Computation Models
Sort
View
BIRTHDAY
2009
Springer
16 years 28 days ago
Hybrid BDD and All-SAT Method for Model Checking
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
Avi Yadgar, Orna Grumberg, Assaf Schuster
SIGSOFT
2007
ACM
16 years 6 months ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 6 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
DCOSS
2009
Springer
15 years 10 months ago
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
Kamrul Islam, Selim G. Akl, Henk Meijer
151
Voted
WWW
2008
ACM
16 years 6 months ago
Recommending questions using the mdl-based tree cut model
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
Yunbo Cao, Huizhong Duan, Chin-Yew Lin, Yong Yu, H...