4940 search results - page 74 / 988 » On the Complexity of Universal Programs |
116
click to vote
ADG
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
243
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
125
click to vote
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
Within the EP-Cache project, the Performance Cockpit has been developed to provide a unified GUI for a series of performance tools. This is achieved through the establishment of a...
150
Voted
DAGSTUHL
2006
15 years 5 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...