National Repository of Grey Literature 307 records found  beginprevious298 - 307  jump to record: Search took 0.02 seconds. 
Inverse Interval Matrix: A Survey
Rohn, Jiří
Fulltext: content.csg - Download fulltextPDF
Plný tet: v1073-10 - Download fulltextPDF
Sborník z 10. mezinárodního workshopu systémů a řízení
Hofman, Radek ; Šmídl, Václav ; Pavelková, Lenka
The principle aim of the workshop is to bring young researchers in cybernetics with various backgrounds together in order to exchange knowledge and find inspiration for further research.
Search of local maximum of function, algorithm "postup06"
Byczanski, Petr
Local maximum of differentiable function is found by sequential change of argument. In the neighbourhood of each proceed point is function approximated with only 2 elements of Taylor expansion. The change of argument is primary bounded by keeping certain level accuracy of approximation.
O efektivním algoritmu pro marginalizaci v kompozicionálních modelech
Bína, V. ; Jiroušek, Radim
The paper presents the necessary theoretical background and a brief description of an effective algorithm for marginalization in multidimensional compositional models.
Genetic Algorithm and Numerical Simulations in Ultrasonic NDT
Převorovský, Zdeněk ; Vodička, Josef
Application of advanced artificial intelligence algorithms as artificial neural networks, genetic algorithms, cellular automata, fuzzy and ANN-based classification and pattern recognition systems, in ultrasonic NDT.
Implementation of a Simple Algorithm for the Continuous Determination of the Local Stiffness Matrix during Computation
Fiala, Zdeněk
The algorithm was deviced so as to allow simple implementation of both Lagrange and Ľ Hermite elements in 2D and 3D.
The algorithm for seeking the shortest path used in a traffic network - adjustments relative to current restrictions of the network
Kohout, Pavel ; Kuncová, Martina (advisor) ; Tichý, Vladimír (referee)
The content of this bachelor thesis is formed by introduction and description of selected algorithms for seeking the shortest path in a graph, and by demonstration of theirs utilization. I concentrate on a practical problem on which I demonstrate an operation of the algorithm in respect to a traffic network with restrictions using real data. Apart from that, my target is to describe some realms where these algorithms could be used. Special emphasis is given to available solution and their problems. The goal of this thesis is to increase knowledge about these algorithms and to support their usage and further improvement.

National Repository of Grey Literature : 307 records found   beginprevious298 - 307  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.