| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 9 / 9
First pagePrevious page1Next pageLast page
1.
Differential evolution and large-scale optimization applications
Aleš Zamuda, scientific or documentary film, sound or video publication

Abstract: Differential Evolution (DE) is one of the most popular, high-performance optimization algorithms with variants that have been outperforming others for years. As a result, DE has grown to accommodate wide usage for a variety of disciplines across scientific fields. Differential Evolution and Large-Scale Optimization Applications presents a research-based overview and cross-disciplinary applications of optimization algorithms. Emphasizing applications of Differential Evolution (DE) across sectors and laying the foundation for further use of DE algorithms in real-world settings, this video is an essential resource for researchers, engineers, and graduate-level students. Topics Covered : Algorithms, Optimization, Parallel Differential Evolution, Performance Improvement, Stochastic Methods, Tree Model Reconstruction.
Keywords: differential Evolution, optimization, algorithms, stochastic methods, tree models, tree model reconstruction
Published: 14.05.2019; Views: 574; Downloads: 157
URL Link to file
This document has many files! More...

2.
Weak k-reconstruction of Cartesian products
Wilfried Imrich, Blaž Zmazek, Janez Žerovnik, 2003, original scientific article

Abstract: By Ulam's conjecture every finite graph ▫$G$▫ can be reconstructed from its deck of vertex deleted subgraphs. The conjecture is still open, but many special cases have been settled. In particular, one can reconstruct Cartesian products. We consider the case of ▫$k$▫-vertex deleted subgraphs of Cartesian products and prove that one can decide whether a graph ▫$H$▫ is a ▫$k$▫-vertex deleted subgraph of a Cartesian product ▫$G$▫ with at least ▫$k+1$▫ prime factors on at least ▫$k+1$▫ vertices each, and that ▫$H$▫ uniquely determines ▫$G$▫. This extends previous works of the authors and Sims. This paper also contains a counterexample to a conjecture of MacAvaney.
Keywords: mathematics, graph theory, reconstruction problem, Cartesian product, composite graphs
Published: 31.03.2017; Views: 816; Downloads: 291
.pdf Full text (197,33 KB)
This document has many files! More...

3.
Reconstructing 3D curves with euclidean minimal spanning trees
Simon Kolmanič, Nikola Guid, 2006, original scientific article

Abstract: In this paper, we present a new efficient algorithm for reconstruction of nonintersecting 3D curves from a sufficiently den se sample. We use the Euclidean minimal spanning trees to identify line segments reconstructing curve shapes. To deal with more than one curve in a sample and to eliminate noisy data, we introduce chains of connected line segments. With the incremental growth based on heuristics, the chains contain finally curve shapes. The method is robust and fast for both 2D and 3D curves.
Keywords: oblaki točk, rekonstrukcija krivulj, evklidska minimalna vpeta drevesa, point cloud, curve reconstruction, euclidean minimal spanning trees
Published: 10.07.2015; Views: 991; Downloads: 23
URL Link to full text

4.
5.
Weak reconstruction of strong product graphs
Blaž Zmazek, Janez Žerovnik, 2007, original scientific article

Abstract: We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.
Keywords: matematika, teorija grafov, problem rekonstrukcije, šibka rekonstrukcija, krepki produkt grafov, mathematics, graph theory, reconstruction problem, strong product, composite graphs
Published: 10.07.2015; Views: 505; Downloads: 346
URL Link to full text

6.
On the weak reconstruction of strong product graphs
Blaž Zmazek, Janez Žerovnik, 2003, published scientific conference contribution

Abstract: We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.
Keywords: matematika, teorija grafov, problem rekonstrukcije, šibka rekonstrukcija, krepki produkt grafov, mathematics, graph theory, reconstruction problem, strong product, composite graphs
Published: 10.07.2015; Views: 531; Downloads: 61
URL Link to full text

7.
Weak k-reconstruction of Cartesian products graphs
Wilfried Imrich, Blaž Zmazek, Janez Žerovnik, 2001, published scientific conference contribution abstract

Abstract: Po Ulamovi domnevi je mogoče vsak končen graf ▫$G$▫ rekonstruirati iz množice vseh podgrafov ▫$G$▫ brez ene točke. Znano je, da je mogoče rekonstruirati kartezične produkte. Obravnavan je soroden problem, imenovan šibka rekonstrukcija. Dokazano je, da je mogoče odločiti, ali se da dani graf ▫$H$▫ dobiti iz nekega kartezičnega produkta ▫$g$▫ z odstranitvijo ▫$k$▫ točk, če privzamemo, da ima ▫$G$▫ vsaj ▫$k+1$▫ faktorjev s po ▫$k+1$▫ točkami. V tem rimeru ▫$H$▫ enolično določa ▫$G$▫. Dan je tudi protiprimer za MacAvaneyjevo domnevo.
Keywords: matematika, teorija grafov, kartezični produkt, problem rekonstrukcije, sestavljeni grafi, mathematics, graph theory, reconstruction problem, Cartesian product, composite graphs
Published: 10.07.2015; Views: 641; Downloads: 7
URL Link to full text

8.
9.
Search done in 0.27 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica