Sciweavers

1615 search results - page 126 / 323
» Computer science and decision theory
Sort
View
80
Voted
MFCS
2004
Springer
15 years 6 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
118
Voted
ICALP
2003
Springer
15 years 5 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli
APAL
2005
117views more  APAL 2005»
15 years 17 days ago
About cut elimination for logics of common knowledge
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
Luca Alberucci, Gerhard Jäger
108
Voted
STTT
2010
92views more  STTT 2010»
14 years 7 months ago
Don't care in SMT: building flexible yet efficient abstraction/refinement solvers
ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
Andreas Bauer 0002, Martin Leucker, Christian Scha...
110
Voted
IJISEC
2007
119views more  IJISEC 2007»
15 years 17 days ago
An incentive compatible reputation mechanism for ubiquitous computing environments
The vision of ubiquitous computing is becoming a reality thanks to the advent of portable devices and the advances in wireless networking technologies. It aims to facilitate user ...
Jinshan Liu, Valérie Issarny