Results 21 to 30 of about 36,225 (338)
Divide-and-Conquer With Sequential Monte Carlo [PDF]
, 2017 We propose a novel class of Sequential Monte Carlo (SMC) algorithms, appropriate for inference in probabilistic graphical models. This class of algorithms adopts a divide-and-conquer approach based upon an auxiliary tree-structured decomposition of the ...
Aston, JAD +6 more
core +1 more source
A priori filtration of points for finding convex hull
Technological and Economic Development of Economy, 2006 Convex hull is the minimum area convex polygon containing the planar set. By now there are quite many convex hull algorithms (Graham Scan, Jarvis March, QuickHull, Incremental, Divide‐and‐Conquer, Marriage‐before‐Conquest, Monotone Chain, Brute Force ...
Laura Vyšniauskaitė +1 more
doaj +1 more source
Enhanced Teaching–Learning-Based Optimization Algorithm for the Mobile Robot Path Planning Problem
Applied Sciences, 2023 This research proposes an enhanced teaching–learning based optimization (ETLBO) algorithm to realize an efficient path planning for a mobile robot. Four strategies are introduced to accelerate the teaching–learning based optimization (TLBO) algorithm and
Shichang Lu +3 more
doaj +1 more source
Divide-and-conquer sequential matrix diagonalisation for parahermitian matrices [PDF]
, 2017 A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and will diagonalise a parahermitian matrix via paraunitary operations ...
Corr, Jamie +4 more
core +1 more source
Additive tree functionals with small toll functions and subtrees of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Many parameters of trees are additive in the sense that they can be computed recursively from the sum of the branches plus a certain toll function. For instance, such parameters occur very frequently in the analysis of divide-and-conquer algorithms. Here
Stephan Wagner
doaj +1 more source
Reducing the Depth of Linear Reversible Quantum Circuits
IEEE Transactions on Quantum Engineering, 2021 In quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited when using current hardware.
Timothee Goubault de Brugiere +4 more
doaj +1 more source
Centralized approaches for virtual network function placement in SDN-enabled networks
EURASIP Journal on Wireless Communications and Networking, 2018 Software-defined networking (SDN) and network function virtualization (NFV) represent significant changes to the architecture of data networks. SDN provides clean separation of the control plane from the data plane while NFV helps virtualize functions ...
Akshay Gadre +2 more
doaj +1 more source
Mathematics, 2022 Nature-inspired metaheuristic algorithms remain a strong trend in optimization. Human-inspired optimization algorithms should be more intuitive and relatable. This paper proposes a novel optimization algorithm inspired by a human search party.
A. S. Syed Shahul Hameed +1 more
doaj +1 more source
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry, 2007 German Academic Exchange Service (DAAD)
Bose, Prosenjit +5 more
openaire +4 more sources
Scalability and Validation of Big Data Bioinformatics Software
Computational and Structural Biotechnology Journal, 2017 This review examines two important aspects that are central to modern big data bioinformatics analysis – software scalability and validity. We argue that not only are the issues of scalability and validation common to all big data bioinformatics analyses,
Andrian Yang +2 more
doaj +1 more source