activity
20172020
most citedGeneral Algorithmic Search

4 citations · 4 across the 1 of their papers we have counts for

collaborators

5 papers

math.DS2020

Entropy monotonicity and superstable cycles for the quadratic family revisited

José M. Amigó, Angel Giménez

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity…

physics.data-an2020

A generalized permutation entropy for random processes

José M. Amigó, Roberto Dale, Piergiulio Tempesta

Permutation entropy measures the complexity of deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or just permutations. T…

math.DS2020

Internet congestion control: from stochastic to dynamical models

José M. Amigó, Angel Giménez, Oscar Martínez-Bonastre +1

Since its inception, control of data congestion on the Internet has been based on stochastic models. One of the first such models was Random Early Detection. Later, this model was…

math.DS2019

Differentiable programming and its applications to dynamical systems

Adrián Hernández, José M. Amigó

Differentiable programming is the combination of classical neural networks modules with algorithmic ones in an end-to-end differentiable model. These new models, that use automatic…

math.OC20174 cited

General Algorithmic Search

Sergio Hernández, Guillem Duran, José M. Amigó

In this paper we present a metaheuristic for global optimization called General Algorithmic Search (GAS). Specifically, GAS is a stochastic, single-objective method that evolves a…