JAIST Repository: 遺伝的アルゴリズムの並列化と多目的最適化問題への適用
2
0
0
全文
(2)
(3) .
(4)
(5) . .
(6)
(7)
(8)
(9)
(10) .
(11)
(12) . . !
(13)
(14) .
(15)
(16)
(17) . Æ "
(18)
(19)
(20) #
(21) " $
(22)
(23) % !
(24) . . "
(25)
(26) $
(27) ! "
(28) % "
(29)
(30) & . "
(31) . '
(32)
(33)
(34) . " $
(35) % ( .
(36)
(37)
(38)
(39)
(40)
(41)
(42)
(43)
(44)
(45)
(46) .
(47)
(48) ).
(49)
関連したドキュメント
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework.. SIAM Journal on Optimization,
Dual averaging and proximal gradient descent for online alternating direction multiplier method. Stochastic dual coordinate ascent with alternating direction method
Hungarian Method Kuhn (1955) based on works of K ő nig and
of IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS 2010), pp..
情報理工学研究科 情報・通信工学専攻. 2012/7/12
最大消滅部分空間問題 MVSP Maximum Vanishing Subspace Problem.. MVSP:
参考文献 Niv Buchbinder and Joseph (Seffi) Naor: The Design of Com- petitive Online Algorithms via a Primal-Dual Approach. Foundations and Trends® in Theoretical Computer
"A matroid generalization of the stable matching polytope." International Conference on Integer Programming and Combinatorial Optimization (IPCO 2001). "An extension of
