動的オークションに対するオンラインメカニズムの被験者実験 (数理最適化の発展 : モデル化とアルゴリズム)

[Nitanda&Suzuki: Fast Convergence Rates of Averaged Stochastic Gradient Descent under Neural Tangent Kernel Regime,

Max-flow min-cut theorem and faster algorithms in a circular disk failure model, INFOCOM 2014...

Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework.. SIAM Journal on Optimization,

Hungarian Method Kuhn (1955) based on works of K ő nig and

of IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS 2010), pp..

最大消滅部分空間問題 MVSP Maximum Vanishing Subspace Problem.. MVSP:

 県民のリサイクルに対する意識の高揚や活動の定着化を図ることを目的に、「環境を守り、資源を

EXPERIMENTAL STUDY ON THE REUSE OF INDUSTRIAL WASTE IN LIQUEFIED SOIL STABILIZATION MATERIAL.. Hideaki Shibata ＊1 ， Masatomo