144 search results - page 6 / 29 » Running time and program size for self-assembled squares |
JIT
2004
Springer
14 years 23 days ago
2004
Springer
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fty generations we measured bloat O(generations1:2;1:5). On two simple benchmarks w...
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
APLAS
2010
ACM
13 years 5 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...