Sciweavers

70 search results - page 2 / 14
» Better Quasi-Ordered Transition Systems
Sort
View
IFIP
2005
Springer
14 years 1 months ago
Opacity Generalised to Transition Systems
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...
Jeremy Bryans, Maciej Koutny, Laurent Mazaré...
IGPL
2010
120views more  IGPL 2010»
13 years 6 months ago
A complete axiom set for Hansson's deontic logic DSDL2
The main contribution of this paper is a (strong) completeness result for an axiomatization of Hansson [13]’s deontic system DSDL2, whose semantics involves a non-necessarily tr...
Xavier Parent
ICCAD
2004
IEEE
118views Hardware» more  ICCAD 2004»
14 years 4 months ago
Optimizing mode transition sequences in idle intervals for component-level and system-level energy minimization
New embedded systems offer rich power management features in the form of multiple operational and non-operational power modes. While they offer mechanisms for better energy effic...
Jinfeng Liu, Pai H. Chou
WEBDB
2010
Springer
155views Database» more  WEBDB 2010»
14 years 26 days ago
Learning Topical Transition Probabilities in Click Through Data with Regression Models
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how di...
Xiao Zhang, Prasenjit Mitra
JDA
2006
184views more  JDA 2006»
13 years 7 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano