Sciweavers

1686 search results - page 311 / 338
» Programs as polygraphs: computability and complexity
Sort
View
DSL
1997
14 years 8 days ago
Experience with a Language for Writing Coherence Protocols
In this paper we describe our experience with Teapot [7], a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distrib...
Satish Chandra, James R. Larus, Michael Dahlin, Br...
IJCAI
1997
14 years 8 days ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
ATAL
2010
Springer
14 years 1 days ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
SIGMOD
2010
ACM
191views Database» more  SIGMOD 2010»
13 years 11 months ago
Data conflict resolution using trust mappings
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
Wolfgang Gatterbauer, Dan Suciu
BMCBI
2010
122views more  BMCBI 2010»
13 years 11 months ago
An overview of the CellML API and its implementation
Background: CellML is an XML based language for representing mathematical models, in a machine-independent form which is suitable for their exchange between different authors, and...
Andrew K. Miller, Justin Marsh, Adam Reeve, Alan G...