Sciweavers

1636 search results - page 281 / 328
» Reasoning About Quantum Systems
Sort
View
ATAL
2011
Springer
14 years 6 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
227
Voted
HOST
2011
IEEE
14 years 5 months ago
Enhancing security via provably trustworthy hardware intellectual property
—We introduce a novel hardware intellectual property acquisition protocol, show how it can support the transfer of provably trustworthy modules between hardware IP producers and ...
Eric Love, Yier Jin, Yiorgos Makris
POPL
2012
ACM
14 years 1 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
CADE
2007
Springer
16 years 6 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
SEMWEB
2007
Springer
16 years 6 days ago
Hybrid Alignment Strategy for Anatomical Ontologies: Results of the 2007 Ontology Alignment Contest
An ontology is a formal representation of a domain modeling the entities in the domain and their relations. When a domain is represented by multiple ontologies, there is a need for...
Songmao Zhang, Olivier Bodenreider