7 search results - page 1 / 2 » Set Operations for Recurrent Term Schematizations |
TAPSOFT
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
A fuzzy controller is usually designed by formulating the knowledge of a human expert into a set of linguistic variables and fuzzy rules. Among the most successful methods to auto...
CPM
1995
Springer
13 years 8 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
POPL
2008
ACM
14 years 5 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
ICPP
1999
IEEE
13 years 9 months ago
1999
IEEE
Loops are the main time consuming part of programs based on floating point computations. The performance of the loops is limited either by recurrences in the computation or by the...