Sciweavers

851 search results - page 108 / 171
» Inaccessibility in Decision Procedures
Sort
View
FORTE
1990
13 years 10 months ago
Verifying Bisimulations "On the Fly"
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
Jean-Claude Fernandez, Laurent Mounier
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
13 years 10 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
ICASSP
2010
IEEE
13 years 9 months ago
Stochastic pronunciation modelling and soft match for out-of-vocabulary spoken term detection
A major challenge faced by a spoken term detection (STD) system is the detection of out-of-vocabulary (OOV) terms. Although a subword-based STD system is able to detect OOV terms,...
Dong Wang, Simon King, Joe Frankel, Peter Bell
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 9 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 9 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...