Sciweavers

721 search results - page 86 / 145
» A Living System Must Have Noncomputable Models
Sort
View
IJFCS
2006
110views more  IJFCS 2006»
15 years 16 days ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
123
Voted
PVLDB
2008
160views more  PVLDB 2008»
15 years 1 days ago
BayesStore: managing large, uncertain data repositories with probabilistic graphical models
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...
Daisy Zhe Wang, Eirinaios Michelakis, Minos N. Gar...
106
Voted
JANCL
2007
115views more  JANCL 2007»
15 years 14 days ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
TPDS
2008
130views more  TPDS 2008»
15 years 13 days ago
NFS-CD: Write-Enabled Cooperative Caching in NFS
We present the Network File System with Cluster Delegation (NFS-CD), an enhancement to the NFSv4 that reduces server load and increases the scalability of distributed file systems ...
Alexandros Batsakis, Randal C. Burns
99
Voted
DLOG
2003
15 years 1 months ago
Relationships with other Formalisms
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issu...
Ulrike Sattler, Diego Calvanese, Ralf Molitor