Sciweavers

1204 search results - page 194 / 241
» Hybrid Probabilistic Programs
Sort
View
ICALP
2001
Springer
14 years 2 months ago
Secure Games with Polynomial Expressions
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
Aggelos Kiayias, Moti Yung
PAPM
2001
Springer
107views Mathematics» more  PAPM 2001»
14 years 2 months ago
MoDeST - A Modelling and Description Language for Stochastic Timed Systems
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter ...
ICALP
1990
Springer
14 years 1 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...
ENTCS
2010
96views more  ENTCS 2010»
13 years 9 months ago
Optimizing Conditional Logic Reasoning within CoLoSS
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
Daniel Hausmann, Lutz Schröder
JCO
1998
136views more  JCO 1998»
13 years 9 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...