4940 search results - page 757 / 988 » On the Complexity of Universal Programs |
186
click to vote
ARTMED
2002
15 years 6 months ago
2002
This paper presents an evolutionary artificial neural network approach based on the pareto differential evolution algorithm augmented with local search for the prediction of breas...
179
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
159
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
177
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract: Systematic testing of object-oriented software turned out to be much more complex than testing conventional software. Especially the highly incremental and iterative deve...
141
click to vote
MT
1998
15 years 6 months ago
1998
Real-world natural language sentences are long and complex, and always contain unexpected grammatical constructions. It even includes noise and ungrammaticality. This paper descri...