In this paper, we establish hardness and approximation results for various Lp-ball constrained homogeneous polynomial optimization problems, where p ∈ [2, ∞]. Specifically, we prove that for any given ...
On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...
This is a preview. Log in through your library . Journal Information The Journal of Philosophical Logic provides a forum for work at the crossroads of philosophy and logic, old and new, with ...
Tsukuba, Japan—Distributed constraint optimization problems are crucial for modeling cooperative-multiagent systems. Asynchronous Distributed OPTimization (ADOPT) is a well-known algorithm for solving ...
On December 2, 2019 Saikko successfully defended his doctoral thesis Implicit Hitting Set Algorithms for Constraint Optimization M.Sc. Paul Saikko succesfully defended his doctoral ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback