4940 search results - page 95 / 988 » On the Complexity of Universal Programs |
158
click to vote
ASWEC
2010
IEEE
15 years 4 months ago
2010
IEEE
—Reducing software complexity is key to reducing software maintenance costs. To discover complexity-reducing practices, in this paper we study the evolution of seven sizable open...
123
click to vote
CIE
2005
Springer
15 years 10 months ago
2005
Springer
1 and 2, and in the last Section 4 of this abstract I will outline very briefly some conclusions about recursion and complexity which I believe that they support. 1 Partial Algebr...
139
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
140
click to vote
SAS
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
148
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...