4940 search results - page 602 / 988 » On the Complexity of Universal Programs |
192
click to vote
ECOOP
1999
Springer
15 years 11 months ago
1999
Springer
Many Java programmers believe they do not have to worry about memory management because of automatic garbage collection. In fact, many Java programs run out of memory unexpectedly ...
184
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
195
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
175
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: We observe two trends in bioinformatics: (i) analyses are increasing in complexity, often requiring several applications to be run as a workflow; and (ii) multiple CPU...
280
click to vote
TOPLAS
2008
15 years 6 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...