462 search results - page 68 / 93 » Symbolic Bounded Synthesis |
123
click to vote
ATVA
2011
Springer
14 years 1 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
141
Voted
ICIP
2009
IEEE
14 years 11 months ago
2009
IEEE
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
121
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
130
Voted
IANDC
2008
15 years 1 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
97
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...