Sciweavers

106 search results - page 4 / 22
» Light Logics and Optimal Reduction: Completeness and Complex...
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
SENSYS
2005
ACM
14 years 29 days ago
Intelligent light control using sensor networks
Increasing user comfort and reducing operation costs have always been two primary objectives of building operations and control strategies. Current building control strategies are...
Vipul Singhvi, Andreas Krause, Carlos Guestrin, Ja...
RSCTC
2000
Springer
139views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
Application of Normalized Decision Measures to the New Case Classification
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
Dominik Slezak, Jakub Wroblewski
ACSD
2010
IEEE
239views Hardware» more  ACSD 2010»
13 years 5 months ago
A Complete Synthesis Method for Block-Level Relaxation in Self-Timed Datapaths
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
W. B. Toms, David A. Edwards
CORR
2002
Springer
74views Education» more  CORR 2002»
13 years 7 months ago
A logical reconstruction of SPKI
SPKI/SDSI is a proposed public key infrastructure standard that incorporates the SDSI public key infrastructure. SDSI's key innovation was the use of local names. We previous...
Joseph Y. Halpern, Ron van der Meyden