Sciweavers

2584 search results - page 310 / 517
» On the Forward Checking Algorithm
Sort
View
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
15 years 7 months ago
A Dolev-Yao Model for Zero Knowledge
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
DAM
2007
88views more  DAM 2007»
15 years 6 months ago
Hybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
Jesse D. Bingham, Brad Bingham
ENTCS
2007
98views more  ENTCS 2007»
15 years 6 months ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
TCS
2008
15 years 6 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
ICFEM
2010
Springer
15 years 5 months ago
A Methodology for Automatic Diagnosability Analysis
We present an algorithm based on temporal-epistemic model checking combined with fault injection to analyse automatically the diagnosability of faults by agents in the system. We d...
Jonathan Ezekiel, Alessio Lomuscio