Sciweavers

5158 search results - page 120 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
POPL
2009
ACM
14 years 10 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
ECAI
2006
Springer
14 years 1 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
HASKELL
2009
ACM
14 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
KR
2000
Springer
14 years 1 months ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy
SIGCOMM
2010
ACM
13 years 10 months ago
Theory and new primitives for safely connecting routing protocol instances
Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise ne...
Franck Le, Geoffrey G. Xie, Hui Zhang