(1) Background: Structuring is important in parallel programming order to master its complexity, and this structuring could be achieved through patterns skeletons. Divide-and-conquer computation essentially defined by a recurrence relation that links the solution of problem solutions subproblems same type, but smaller sizes. This pattern allows specification different types computations, so it ...

We introduce an inductive logic programming approach that combines classical divide-and-conquer search with modern constraint-driven search. Our anytime can learn optimal, recursive, and large programs supports predicate invention. experiments on three domains (classification, general game playing, program synthesis) show our increase predictive accuracies reduce learning times.

This paper reports a case study in the development of parallel programs in the Bird-Meertens formalism (BMF), starting from divide-and-conquer algorithm speciications. The contribution of the paper is twofold: (1) we classify divide-and-conquer algorithms and formally derive a parameterized family of parallel implementations for an important subclass of divide-and-conquer, called DH (distributa...

news & views the eventual transition to homogenous 3ʹ,5ʹ-linked genetic material. T echnologies for generating electricity from renewable resources, such as sunlight and wind, are on a steady trajectory of falling cost. Within the next decade, solar electric power is expected to reach grid parity, the point at which its cost will be equivalent (on a per-watt basis) to that of power generated fr...

Several important computer vision tasks have recently been formulated as lowrank problems, with the Low-Rank Representation method (LRR) being one recent and prominent formulation. Although the method is framed as a convex program, available solutions to this program are inherently sequential and costly, thus limiting its scalability. In this work, we explore the effectiveness of a recently int...

Two theoretical studies reveal how networks of neurons may behave during reward-based learning.

An algorithm for the solution of banded linear systems is presented and discussed which combines stability with scalability. This is achieved by implementing divide and conquer for Gaussian elimination with partial pivoting. Earlier divide and conquer algorithms for Gaussian elimination have problems with instabil-ities and can even break down as they implement a more restricted form of pivotin...

Divide-and-conquer has been demonstrated as a simple and efficient programming model for grid applications. In previous work, we have presented the divide-and-conquer based Satin system and its load balancing algorithm, clusteraware work stealing (CRS). In this paper, we provide a detailed analysis of CRS with respect to important properties of grid systems, namely scalability, heterogeneous co...

We study the accuracy of the divide-and-conquer method for electronic structure calculations. The analysis is conducted for a prototypical subdomain problem in the method. We prove that the pointwise difference between electron densities of the global system and the subsystem decays exponentially as a function of the distance away from the boundary of the subsystem, under the gap assumption of ...