Sciweavers

412 search results - page 9 / 83
» Completion for Multiple Reduction Orderings
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
ENTCS
2010
118views more  ENTCS 2010»
13 years 4 months ago
Systematic Refinement of Performance Models for Concurrent Component-based Systems
Model-driven performance prediction methods require detailed design models to evaluate the performance of software systems during early development stages. However, the complexity...
Lucia Kapová, Steffen Becker
ICASSP
2011
IEEE
12 years 11 months ago
Clean: A false alarm reduction method for SAR CCD
Synthetic Aperture Radar Coherent Change Detection (SAR CCD) is a sensitive change detector capable of finding ground surface height changes on the order of a radar wavelength. W...
Rhonda D. Phillips
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 7 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh
FLAIRS
2004
13 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar