The author presents a rapidly convergent algorithm to solve the general portfolio problem of maximizing concave utility functions subject to linear constraints. The algorithm is based on an iterative ...

Wim J. van der Linden, Hao Ren, A Fast and Simple Algorithm for Bayesian Adaptive Testing, Journal of Educational and Behavioral Statistics, Vol. 45, No. 1 (February 2020), pp. 58-85 ...

Let people look inside the black box of the algorithm, and their mistrust, hostility, and fear will gradually melt away. Right? Well, kinda.

With this in mind, for a Hackaday prize entry [int-smart] is working on a quadcopter testbed for developing algorithms, specifically localization and mapping.

A simple checklist of seven clinical signs and symptoms could be used to identify sick neonates during the first week of life with potentially life-threatening illnesses requiring referral to ...

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proven that it’s “universally optimal.” ...