GitHub

Tromino Tiling Problem using Divide and Conquer algorithm

Given a n by n board where n is of form 2k where k >= 1 (Basically n is a power of 2 with minimum value as 2). The board has one missing cell (of size 1 x 1). Fill the board using L shaped tiles. A L ...
IEEE

Dimensionality Reduction for Classification Using Divide-and-Conquer Based Genetic Programming

Abstract: Dimensionality reduction (DR) is to obtain meaningful low-dimensional representation concealed within high-dimensional data. Genetic programming (GP) has been used to achieve DR for ...
GitHub

Write a Perl program to implement binary search

Binary search is a fast search algorithm with run-time complexity of Ο(log n). This search algorithm works on the principle of divide and conquer. For this algorithm to work properly, the data ...
Microsoft

Scaling Enumerative Program Synthesis via Divide and Conquer

Given a semantic constraint specified by a logical formula, and a syntactic constraint specified by a context-free grammar, the Syntax-Guided Synthesis (SyGuS) problem is to find an expression that ...