Árpád Bürmen

According to our database, Árpád Bürmen authored at least 19 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Imperative Genetic Programming.

Iztok Fajfar, Ziga Rojec, Árpád Bürmen, Matevz Kunaver, Tadej Tuma, Saso Tomazic, Janez Puhan

Symmetry, September, 2024

2022

PyCUTEst: an open source Python package of optimization test problems.

Jaroslav M. Fowkes, Lindon Roberts, Árpád Bürmen

J. Open Source Softw., October, 2022

2019

The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization.

Iztok Fajfar, Árpád Bürmen, Janez Puhan

Optim. Lett., 2019

Analog circuit topology synthesis by means of evolutionary computation.

Ziga Rojec, Árpád Bürmen, Iztok Fajfar

Eng. Appl. Artif. Intell., 2019

Mesh adaptive direct search with simplicial Hessian update.

Árpád Bürmen, Iztok Fajfar

Comput. Optim. Appl., 2019

2018

Grammatical evolution as a hyper-heuristic to evolve deterministic real-valued optimization algorithms.

Iztok Fajfar, Árpád Bürmen, Janez Puhan

Genet. Program. Evolvable Mach., 2018

2017

Evolving a Nelder-Mead Algorithm for Optimization with Genetic Programming.

Iztok Fajfar, Janez Puhan, Árpád Bürmen

Evol. Comput., 2017

2016

An evolution-driven analog circuit topology synthesis.

Ziga Rojec, Árpád Bürmen, Iztok Fajfar

Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

2015

Mesh adaptive direct search with second directional derivative-based Hessian update.

Árpád Bürmen, Jernej Olensek, Tadej Tuma

Comput. Optim. Appl., 2015

2011

Direct search approach to integrated circuit sizing for high parametric yield.

Gregor Cijan, Tadej Tuma, Árpád Bürmen

IET Circuits Devices Syst., 2011

A new asynchronous parallel global optimization method based on simulated annealing and differential evolution.

Jernej Olensek, Tadej Tuma, Janez Puhan, Árpád Bürmen

Appl. Soft Comput., 2011

2009

DESA: a new hybrid global optimization method and its application to analog integrated circuit sizing.

Jernej Olensek, Árpád Bürmen, Janez Puhan, Tadej Tuma

J. Glob. Optim., 2009

A Direct Search Method for Worst Case Analysis and Yield Optimization of Integrated Circuits.

Gregor Cijan, Tadej Tuma, Árpád Bürmen

J. Circuits Syst. Comput., 2009

A direct search method for finding the worst performance measure in integrated circuit design.

Gregor Cijan, Tadej Tuma, Árpád Bürmen

Proceedings of the 19th European Conference on Circuit Theory and Design, 2009

2008

A Combined Simplex-trust-Region Method for Analog Circuit Optimization.

Árpád Bürmen, Tadej Tuma, Iztok Fajfar

J. Circuits Syst. Comput., 2008

2007

Sprouting search - an algorithmic framework for asynchronous parallel unconstrained optimization.

Árpád Bürmen, Tadej Tuma

Optim. Methods Softw., 2007

Combined simplex-trust-region optimization algorithm for automated IC design.

Árpád Bürmen, Iztok Fajfar, Tadej Tuma

Proceedings of the 18th European Conference on Circuit Theory and Design, 2007

2006

Grid Restrained Nelder-Mead Algorithm.

Árpád Bürmen, Janez Puhan, Tadej Tuma

Comput. Optim. Appl., 2006

2003

Defining Cost Functions for Robust IC Design and Optimization.

Árpád Bürmen, Janez Puhan, Tadej Tuma

Proceedings of the 2003 Design, 2003