462 search results - page 72 / 93 » Symbolic Bounded Synthesis |
132
Voted
IANDC
2007
15 years 1 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
129
click to vote
ECCC
2010
15 years 12 days ago
2010
We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − ǫ) fraction of all symbols transmitted by th...
117
click to vote
MLQ
2010
15 years 8 days ago
2010
We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for...
123
Voted
RSP
2006
IEEE
15 years 7 months ago
2006
IEEE
In a hardware-software co-design environment, an application is partitioned into modules. Each module is then mapped either to software or to hardware. The mapping process is driv...
113
click to vote
ACSD
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...