462 search results - page 64 / 93 » Symbolic Bounded Synthesis |
131
click to vote
AUTOMATICA
2005
15 years 1 months ago
2005
Various techniques of system identification exist that provide a nominal model and an uncertainty bound. An important question is what the implications are for the particular choi...
134
Voted
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
167
click to vote
VLSID
2007
IEEE
16 years 2 months ago
2007
IEEE
We present AHIR, an intermediate representation (IR), that acts as a transition layer between software compilation and hardware synthesis. Such a transition layer is intended to t...
118
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
131
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...