Analysis of the coordinate ascent algorithm for discrete optimization problems
Shenmaier, Vladimir Vladimirovich, 2001, Candidate of Sciences dissertation
Novosibirsk
109 pp.
More works in this specialty
- On probabilities of values of random Boolean expressions
Yashunskiy, Aleksey Dmitrievich · 2006 · Candidate of Sciences
- Coding of stochastic context-free languages
Zhil'tsova, Larisa Pavlovna · 2004 · Doctor of Sciences
- Properties of optimal schedules and efficient algorithms for solving some NP-hard problems of single-machine scheduling theory
Shulgina, Oksana Nikolaevna · 2001 · Candidate of Sciences
- The problem of selling real estate: a game-theoretic approach
Fal'ko, Igor Antonovich · 2001 · Candidate of Sciences
- Operators in polynomial representations of Boolean functions
Vinokurov, Sergey Fedorovich · 2001 · Doctor of Sciences