462 search results - page 76 / 93 » Symbolic Bounded Synthesis |
114
click to vote
AB
2007
Springer
15 years 5 months ago
2007
Springer
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
106
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has con...
116
Voted
ICCAD
2010
IEEE
14 years 11 months ago
2010
IEEE
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
110
click to vote
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
—The growing trend towards using component based design approach in embedded system development requires addressing newer system engineering challenges. These systems are usually...
109
click to vote
FMSD
2006
15 years 1 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...