Sciweavers

798 search results - page 96 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
ALT
2010
Springer
13 years 9 months ago
Distribution-Dependent PAC-Bayes Priors
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
Guy Lever, François Laviolette, John Shawe-...
LICS
2000
IEEE
14 years 2 days ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 5 months ago
Using Strategy Objectives for Network Security Analysis
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
Elie Bursztein, John C. Mitchell
JACM
2007
84views more  JACM 2007»
13 years 7 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 6 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...