19700 search results - page 153 / 3940 » DNA-Based Computation Times |
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
100
click to vote
IFSA
2007
Springer
15 years 7 months ago
2007
Springer
One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possi...
100
click to vote
ICPP
2002
IEEE
15 years 6 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
114
click to vote
WSC
2001
15 years 2 months ago
2001
This paper describes the use of a particular type of computer simulator as a tool for teaching computer architecture. The Little Man Computer (LMC) paradigm was developed by Stuar...
CIE
2009
Springer
15 years 7 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...