String Submodular Functions With Curvature Constraints

Consider the problem of choosing a string of actions to optimize an objective function that is string submodular. It was shown in previous papers that the greedy strategy, consisting of a string of actions that only locally maximizes the step-wise gain in the objective function, achieves at least a...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on automatic control Ročník 61; číslo 3; s. 601 - 616
Hlavní autori:	Zhenliang Zhang, Chong, Edwin K. P., Pezeshki, Ali, Moran, William
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Approximation Curvature Frequency modulation Gain Mathematical analysis Optimization Strategy Strings Tasks greedy optimal control Combinatorial optimization matroid
ISSN:	0018-9286, 1558-2523
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!