Search
Search results for: computational optimization
-
Accurate Modeling of Antenna Structures by Means of Domain Confinement and Pyramidal Deep Neural Networks
PublicationThe importance of surrogate modeling techniques has been gradually increasing in the design of antenna structures over the recent years. Perhaps the most important reason is a high cost of full-wave electromagnetic (EM) analysis of antenna systems. Although imperative in ensuring evaluation reliability, it entails considerable computational expenses. These are especially pronounced when carrying out EM-driven design tasks such...
-
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Conferences -
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Conferences -
Predicting sulfanilamide solubility in the binary mixtures using a reference solvent approach
PublicationBackground. Solubility is a fundamental physicochemical property of active pharmaceutical ingredients. The optimization of a dissolution medium aims not only to increase solubility and other aspects are to be included such as environmental impact, toxicity degree, availability, and costs. Obtaining comprehensive...
-
Orken Mamyrbayev Professor
People1. Education: Higher. In 2001, graduated from the Abay Almaty State University (now Abay Kazakh National Pedagogical University), in the specialty: Computer science and computerization manager. 2. Academic degree: Ph.D. in the specialty "6D070300-Information systems". The dissertation was defended in 2014 on the topic: "Kazakh soileulerin tanudyn kupmodaldy zhuyesin kuru". Under my supervision, 16 masters, 1 dissertation...
-
International Symposium on Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Conferences -
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublicationThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems
Conferences -
Wiktoria Wojnicz dr hab. inż.
PeopleDSc in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2019 PhD in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2009 (with distinction) List of papers (2009 - ) Wojnicz W., Wittbrodt E., Analysis of muscles' behaviour. Part I. The computational model of muscle. Acta of Bioengineering and Biomechanics, Vol. 11, No.4, 2009, p. 15-21 Wojnicz W., Wittbrodt E., Analysis of...
-
Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages
PublicationThe ability to quantify a dissimilarity of different phylogenetic trees is required in various types of phylogenetic studies, for example, such metrics are used to assess the quality of phylogeny construction methods and to define optimization criteria in supertree building algorithms. In this article, starting from the already described concept of matching metrics, we define three new metrics for rooted phylogenetic trees. One...