4940 search results - page 128 / 988 » On the Complexity of Universal Programs |
129
click to vote
ICSE
2005
IEEE-ACM
16 years 4 months ago
2005
IEEE-ACM
Pair programming is a programming technique in which two programmers use one computer to work together on the same task. There is an ongoing debate over the value of pair programm...
158
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
143
click to vote
CASES
2009
ACM
15 years 2 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
185
click to vote
GPCE
2011
Springer
14 years 4 months ago
2011
Springer
Embedded, textual DSLs are often provided as an API wrapped around object-oriented application frameworks to ease framework integration. While literature presents claims that DSL-...
139
click to vote
AAAI
2008
15 years 7 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...