2 papers
cs.LG2021
Approximate Bayesian Computation of Bézier Simplices
Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi +1
Bézier simplex fitting algorithms have been recently proposed to approximate the Pareto set/front of multi-objective continuous optimization problems. These new methods have shown…
cs.DS2019
A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees
Yasuo Yamane, Kenichi Kobayashi
Recently we submitted a paper, whose title is A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees, to arXiv. This is related to u…