Sciweavers

601 search results - page 83 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
WSFM
2007
Springer
15 years 7 months ago
Extending Model Checking to Data-Aware Temporal Properties of Web Services
A “data-aware” web service property is a constraint on the pattern of message exchanges of a workflow where the order of messages and their data content are interdependent. Th...
Sylvain Hallé, Roger Villemaire, Omar Cherk...
COLING
2010
14 years 8 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
AAAI
2012
13 years 3 months ago
A Spin-Glass Model for Semi-Supervised Community Detection
Current modularity-based community detection methods show decreased performance as relational networks become increasingly noisy. These methods also yield a large number of divers...
Eric Eaton, Rachael Mansbach
DLOG
2010
14 years 11 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
IPPS
2009
IEEE
15 years 8 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker