3663 search results - page 547 / 733 » Problems in the ontology of computer programs |
175
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
146
click to vote
FMCAD
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
144
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
160
click to vote
LPAR
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
215
click to vote
TEX
2004
Springer
15 years 12 months ago
2004
Springer
This paper summarizes experiences in converting METAFONT fonts to PostScript fonts with TEXtrace and mftrace, based on programs of autotracing bitmaps (AutoTrace and potrace), and...