IEEE

An Inner Approximation Algorithm for Dynamic Optimization With Strict Satisfaction of Path Constraints

Abstract: An inner approximation algorithm is proposed for path-constrained dynamic optimization (PCDO) by iteratively solving restrictions of PCDO (RPCDO). First, an upper bound function of the path ...
IEEE

Multiplierless DFT Approximation Based on the Prime Factor Algorithm

Abstract: Matrix approximation methods have successfully produced efficient, low-complexity approximate transforms for the discrete cosine transforms and the discrete Fourier transforms. For the DFT ...
GitHub

SuiMikasa/ATA-Approximation-Algorithm

The ATA algorithm provides a novel approximation framework for analytic functions that cannot be expressed in closed-form via elementary or algebraic functions. It introduces a hybrid approximation ...
Queen Mary University of London

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...
GitHub

Trust Region Preference Approximation: A simple and stable reinforcement learning algorithm for LLM reasoning

We propose the Trust Region Preference Approximation (TRPA) algorithm ⚙️, which integrates rule-based optimization with preference-based optimization for LLM reasoning tasks 🤖🧠. As a ...