889 search results - page 35 / 178 » Problems in Rewriting III |
AE
1999
Springer
14 years 2 months ago
1999
Springer
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
ERSHOV
2006
Springer
14 years 1 months ago
2006
Springer
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and c...
ADCM
2008
13 years 10 months ago
2008
This paper first provides a common framework for partial differential equation problems in both strong and weak form by rewriting them as generalized interpolation problems. Then ...
LATA
2009
Springer
14 years 4 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
ENTCS
2008
13 years 10 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...