Scalability is a term frequently used to qualify the match between an algorithm and architecture in a parallel system (an algorithmarchitecture combination). Evaluating the scalability of a parallel system has widespread applicability. The results from such an evaluation may be used to: select the best architecture platform for an application domain, predict the performance of an application on...

Abstract In this chapter, we discuss computational problems related to ABC rules and algorithms that solve these problems. We start by discussing the complexity of rules. As many are computationally difficult, a thorough algorithmic analysis is paramount practical application

in this paper, we study projected non-stationary simultaneous it-erative reconstruction techniques (p-sirt). based on algorithmic op-erators, convergence result are adjusted with opial’s theorem. the advantages of p-sirt are demonstrated on examples taken from to-mographic imaging.

The speed and transformative power of human cultural evolution is evident from the change it has wrought on our planet. This chapter proposes a human computation program aimed at (1) distinguishing algorithmic from non-algorithmic components of cultural evolution, (2) computationally modeling the algorithmic components, and amassing human solutions to the non-algorithmic (generally, creative) c...

Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...