Sciweavers

989 search results - page 73 / 198
» Pebbling and Proofs of Work
Sort
View
APLAS
2005
ACM
14 years 1 months ago
Integrating Physical Systems in the Static Analysis of Embedded Control Software
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
Patrick Cousot
AIL
2008
103views more  AIL 2008»
13 years 8 months ago
A dialogical theory of presumption
The notions of burden of proof and presumption are central to law, but as noted in McCormick on Evidence, they are also the slipperiest of any of the family of legal terms employe...
Douglas Walton
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 8 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
14 years 2 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
CP
2009
Springer
14 years 8 months ago
On the Power of Clause-Learning SAT Solvers with Restarts
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
Knot Pipatsrisawat, Adnan Darwiche