Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Algorithmic paradigm

An algorithmic paradigm or algorithm design paradigm is a generic model or framework which underlies the design of a class of algorithms. An algorithmic paradigm is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.

Official source

https://en.wikipedia.org/wiki/Algorithmic_paradigm

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (1)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

Related lectures (24)

Algorithm Design: Divide and Conquer

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Problem-solving Strategies 2: Recursion

Explores problem-solving strategies like recursion and divide and conquer methods, with examples such as the Towers of Hanoi.

Dynamic Programming: Rod Cutting and Change Making

Explores dynamic programming through rod cutting and change making optimization problems.

Related publications (17)

Cluster-and-Conquer: When Randomness Meets Graph Locality

Anne-Marie Kermarrec

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data mining and machine-learning applications. Some of the most efficient KNN graph algorithms are incremental and local: they start from a random graph, which they incrementally improve by tr ...

IEEE COMPUTER SOC2021

A fast spectral divide-and-conquer method for banded matrices

Daniel Kressner, Ana Susnjara

Based on the spectral divide-and-conquer algorithm by Nakatsukasa and Higham [SIAM J. Sci. Comput., 35(3):A1325-A1349, 2013], we propose a new algorithm for computing all the eigenvalues and eigenvectors of a symmetric banded matrix with small bandwidth, w ...

WILEY2021

Data reduction for mixed integer linear programming in complex energy systems

François Maréchal, Luc Girardin, Julia Granacher, Luise Middelhauve

The task of optimally designing and scheduling energy systems with a high share of renewable energies is complex and computationally demanding. A widespread method for tackling this task is to apply mixed integer linear programming (MILP). Even though the ...

2021

Related concepts (1)

Divide-and-conquer algorithm

In computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. The divide-and-conquer technique is the basis of efficient algorithms for many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.