2273 search results - page 258 / 455 » On the Expressiveness and Complexity of ATL |
157
click to vote
IPPS
2007
IEEE
16 years 24 days ago
2007
IEEE
Well designed domain specific languages enable the easy expression of problems, the application of domain specific optimizations, and dramatic improvements in productivity for t...
136
click to vote
AAECC
2007
Springer
16 years 21 days ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
153
click to vote
AIIA
2007
Springer
16 years 21 days ago
2007
Springer
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
149
click to vote
ER
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
161
click to vote
IFL
2007
Springer
16 years 19 days ago
2007
Springer
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...