2064 search results - page 147 / 413 » A Comparative Study of Fuzzy Sets and Rough Sets |
160
click to vote
CAV
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
167
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
185
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
160
click to vote
DM
2006
15 years 6 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
144
click to vote
LCN
2008
IEEE
16 years 24 days ago
2008
IEEE
—The major challenge of p-cycle network design resides in finding an optimal set of p-cycles protecting the network for a given working capacity. Existing solutions (exact and h...