Home > Search Results: Šimsa, Štěpán
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Online scheduling of multiprocessor jobs with preemption
 Šimsa, Štěpán ; Sgall, Jiří (advisor) ; Kolman, Petr (referee)
Abstract. The thesis is devoted to the problem of online preemptive scheduling of mul- tiprocessor jobs. It gives a summary of previous work on this problem. For some special variants of the problem, especially if we restrict the sizes of jobs to one and two, new results are given, both in the terms of lower bounds and in the terms of competitive al- gorithms. A previously published lower bound is showed to be computed incorrectly and it is replaced by a correct lower bound in this thesis. An algorithm is presented for the special case of four processors and sizes of jobs one and two that is conjectured to achieve the best possible competitive ratio.
Detailed record
Computational Problems Related to Graph Structures in Evolution
 Šimsa, Štěpán ; Chatterjee, Krishnendu (advisor) ; Loebl, Martin (referee)
In this work we study certain stochastic game that illustrates the concept of punishment and that shows how punishment can improve cooperation. First we introduce the basics of game theory, Markov chains and stochastic games. Then we explain how evolutionary dynamics can be used to evaluate the expected amount of cooperation in a game. Finally we run simulations and do some numerical computations that show how punishment can improve cooperation. Powered by TCPDF (www.tcpdf.org)
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English