Browsing Diplomové práce - 13136 by Subject "Meta-optimization; Lock-chart; meta-heuristic; Machine Learning"
Now showing items 1-1 of 1
; Supervisor: Černoch Radomír; Opponent: Šedivý Jan
Many practical problems are NP-Hard (or NP-Complete), for which best algorithms may guarantee only exponential worth-case time complexity, if P != NP. Typically, these algorithms can not do better, but several types of ...