3113 search results - page 361 / 623 » Efficiently Generating Efficient Generating Extensions in Pr... |
148
click to vote
APN
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
136
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
140
Voted
DSD
2005
IEEE
15 years 6 months ago
2005
IEEE
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
142
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...
144
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...