Sciweavers

744 search results - page 47 / 149
» Observations on the Decidability of Transitions
Sort
View
JSYML
2002
170views more  JSYML 2002»
13 years 8 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
FOSSACS
2012
Springer
12 years 4 months ago
Synthesizing Probabilistic Composers
Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This i...
Sumit Nain, Moshe Y. Vardi
SSDBM
2009
IEEE
168views Database» more  SSDBM 2009»
14 years 3 months ago
Adaptive Physical Design for Curated Archives
Abstract. We introduce AdaptPD, an automated physical design tool that improves database performance by continuously monitoring changes in the workload and adapting the physical de...
Tanu Malik, Xiaodan Wang, Debabrata Dash, Amitabh ...
AVSS
2007
IEEE
14 years 3 months ago
Detection of abandoned objects in crowded environments
With concerns about terrorism and global security on the rise, it has become vital to have in place efficient threat detection systems that can detect and recognize potentially da...
Medha Bhargava, Chia-Chih Chen, Michael S. Ryoo, J...
CAV
2005
Springer
104views Hardware» more  CAV 2005»
14 years 2 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...