4 papers
Efficient solvers for Armijo's backtracking problem
Ivo Fagundes David de Oliveira, Ricardo Hiroshi Caldeira Takahashi
Backtracking is an inexact line search procedure that selects the first value in a sequence that satisfies on with i…
Minmax-optimal list searching with average cost
I. F. D. Oliveira, R. H. C. Takahashi
We find a searching method on ordered lists that surprisingly outperforms binary searching with respect to average query complexity while retaining minmax optimality. The method is…
An incremental descent method for multi-objective optimization
I. F. D. Oliveira, R. H. C. Takahashi
Current state-of-the-art multi-objective optimization solvers, by computing gradients of all objective functions per iteration, produce after iterations a measure of proxim…
Planning on Discrete Event Systems Using Parallelism Maximization
Lucas V. R. Alves, Patrícia N. Pena, Ricardo H. C. Takahashi
This work deals with the production planning problem in Discrete Event Systems, using the Supervisory Control Theory to delimit the search universe and developing two heuristics ba…