|
| |
|
|
E-commerce and strategy e-business
Musilová, Veronika ; Dvořák,, Jiří (referee) ; Dvořák, Jiří (advisor)
I will attend to concept of useful strategy for e-commerce in my bacholer´s thesis wchich will be useful for production companies. The objective is to joint customers requirements with possibilities which are offered by production companies. Intermediary will be already alluded e-commerce. I will inform about customers satisfaction with e-commerce. I will target the trend which is development of internet population proceed, which make up target group of e-shops potential customers. I will make some analyse, which are necessary for proposition of mere strategy in practical part of my bacholer´s thesis. I will attend to aims which copany should achieve, technology which should by available and possibilities , which should be valorize.
|
|
|
The model of direct payments in the internet business
Svobodová, Kateřina ; Dvořák,, Jiří (referee) ; Dvořák, Jiří (advisor)
Diploma thesis is sighting to function direkt payments in electronic scene. Diploma thesis is determining model, which helping with direct payments in the internet business. The aim of diploma thesis is proposal model, which will have better conditions for direkt payments in e-shop. It was better for all companies, which use direct payments in their electronic business. Product of this thesis is abstractedly model, which is applicable for all internet business.
|
|
|
Mobile robot path planning by means of cellular automata
Holoubek, Tomáš ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a path planning using cellular automata algorithms in a rectangular grid environment. Theoretical part starts with an overview of commonly used approaches for path planning and later on focuses on existing cellular automata solutions and capabilities in detail. Implemented cellular automata algorithms and the commonly used path planning algorithms are together with a map generator described in the practical part. Conclusion of this thesis contains results completed in a special application.
|
|
| |
|
| |
|
|
Sorting algorithms
Schwarz, Jakub ; Smrž, Jaroslav (referee) ; Dvořák, Jiří (advisor)
Enormous volume of data, which has been processed during production operations, requires easy orientation and quick searching. Exact search in real time is essential for success. Correct and quick data-sorting is one of the most important activity during dataprocessing. The goal of this bachelor’s thesis is background research of sorting algorithms. To achieve the goal, basic concepts of sorting theory will be described (determined) and there will be division of sorting algorithms by different criterions. For each algorithm of internal array sorting, sorting principles will be described and analysis of efficiency will be provided. The results will be verified by experimental program.
|
|
| |
|
|
Model of internet shop for multimedia
Sedlář, Vítězslav ; Horejsek, Rostislav (referee) ; Dvořák, Jiří (advisor)
This master’s thesis is concerned with the creation of a proposal of internet bookshop. It consists of theoretical findings of internet shopping, analysis of present situation as well as trends in the book area. The goal of my diploma thesis is to project a model of internet shop including necessary changes in company's structure and finally the economical summary of the project.
|
|
|
Production planning under uncertainty
Grulich, Martin ; Popela, Pavel (referee) ; Dvořák, Jiří (advisor)
This diploma work deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure represented by a directed acyclic network, where each node may have several predecessors and successors. We assume stochastic demand, finite planning horizon consisting of discrete time periods, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the total costs over the planning horizon. This thesis includes overview of models with stochastic demand and also general description of genetic algorithm. Using different modifications of genetic algorithm I have proposed and implemented methods for solving a chosen model. Then I have made an experimental comparison of these method on selected problems.
|
guest ::
