Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 23 for “"Computational Complexity Analysis"”.

  1. Computational complexity analysis of linear optimization algorithms

    Computational complexity and performance analysis in Linear Optimization algorithms have always been topics of particular interest among the Operational Research community. In the current thesis, we are presenting all aspects and analysis results of our study on the performance of the Exterior …

    greece Repository record for Computational complexity analysis of linear optimization algorithms (opens in a new tab)

  2. New data fusion algorithms for distributed multi-sensor multi-target environments

    … is compared to that of existing techniques. Computational complexity analysis is also presented. Numerical results based on Monte Carlo simulations and real data collected from the United States Coast Guard Vessel Traffic Services system are presented. The results show that the proposed …

    nps Repository record for New data fusion algorithms for distributed multi-sensor multi-target environments (opens in a new tab)

  3. Symbolic Decentralized Supervisory Control

    … co-observability (SB Co-observability). A computational complexity analysis of the algorithms show that the state-based implementation of algorithms result in quadratic complexity. Further improvements come from using a more compact way of representing finite-state machines namely Binary …

    mcmaster Repository record for Symbolic Decentralized Supervisory Control (opens in a new tab)

  4. Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects

    … scheduling problem with time windows. Finally, a computational complexity analysis for DA is presented for a given temperature schedule. The case study focuses on the geometric cooling law $T(t)=\rho T(t-1), 0<\rho<1$, where $T(t)$ is the temperature at time $t$.

    uiuc Repository record for Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects (opens in a new tab)

  5. Parameterized analysis of bio-inspired computation and the traveling salesperson problem.

    … perform well is still limited. Classical computational complexity analysis often taking a worst case perspective, hardly captures what is happening during the actual algorithm run and, lacks implications for guiding algorithm design. This issue is more significant on the problems such as …

    adelaide Repository record for Parameterized analysis of bio-inspired computation and the traveling salesperson problem. (opens in a new tab)

  6. A Theoretical Study of Clusterability and Clustering Quality

    … from data mining, bioinformatics and image analysis to marketing, psychology, and city planning. Despite the practical importance of clustering, there is very limited theoretical analysis of the topic. We make a step towards building theoretical foundations for clustering by carrying out an …

    waterloo Repository record for A Theoretical Study of Clusterability and Clustering Quality (opens in a new tab)

  7. Graph algorithms to determine sufficient connectivity of collaborative autonomous systems

    … algorithm features poor performance due the high computational complexity of the algorithm both in space and time. We set out to create algorithms with better performance so we propose and implement new algorithms followed by doing computational complexity analysis. The algorithms are compared …

    chalmers Repository record for Graph algorithms to determine sufficient connectivity of collaborative autonomous systems (opens in a new tab)

  8. A Distributed Optimal Control Approach for Multi-agent Trajectory Optimization

    … as existing methods from the literature, and a computational complexity analysis is presented. The methodology is also applied to a track coverage optimization problem for the control of distributed networks of mobile omnidirectional sensors, where the sensors move to maximize the probability of …

    duke Repository record for A Distributed Optimal Control Approach for Multi-agent Trajectory Optimization (opens in a new tab)

  9. Targeted feature extraction : a deep learning approach

    … in each aforementioned area; moreover, computational complexity analysis shows that our method scales linearly with the number of samples in the dataset, and in a linearithmic fashion with respect to the number of raw variables. The main practical contributions of this thesis include a …

    ubc Repository record for Targeted feature extraction : a deep learning approach (opens in a new tab) Download PDF for Targeted feature extraction : a deep learning approach (opens in a new tab)

  10. Exploring the computational power of chemical reaction networks and more deterministic / mechanistic models of molecular computing

    … begun to seriously look at molecular systems as computational devices. Molecular computing systems are a particularly promising approach to nanotechnology, as they operate in wet environments (where traditional electronics typically struggle) and they have the potential to easily interface with …

    texas Repository record for Exploring the computational power of chemical reaction networks and more deterministic / mechanistic models of molecular computing (opens in a new tab)

  11. Nonlinear Compensation in Optical Communications Systems using the Nonlinear Fourier Transform

    … This study consists of two parts: first a computational complexity analysis for the use of the NFT for nonlinear compensation in the normal dispersion regime, and second, an analysis of the robustness of the performance of the discrete spectrum modulation in the anomalous dispersion regime …

    ndsu Repository record for Nonlinear Compensation in Optical Communications Systems using the Nonlinear Fourier Transform (opens in a new tab)

  12. A Geospatial Service Model and Catalog for Discovery and Orchestration

    … (both fully and semi-automatic orchestration). Computational complexity analysis and experimental performance analysis identify potential performance problems in the geospatial service catalog. Solutions to these performance issues are presented in the form of partitioning service instance …

    uno Repository record for A Geospatial Service Model and Catalog for Discovery and Orchestration (opens in a new tab)

  13. Efficient Hierarchical Design in Reservoir Computing

    … of the proposed approach, we conduct a detailed computational complexity analysis, covering MAC operations, parameter count (distinguishing between real-valued and sign-based weights), and memory usage. Furthermore, a unified Figure of Merit (FoM) is introduced to enable fair comparisons across …

    mississippi Repository record for Efficient Hierarchical Design in Reservoir Computing (opens in a new tab)

  14. Secure monitoring system for industrial internet of things using searchable encryption, access control and machine learning

    … ELSA with an increasing number of keywords and complexity. Based on the experimental results and feedback received from the publication and presentation of this work, we published our third technical paper. In this paper, we improved ELSA by minimising the lookup table size and summarising the …

    glasgow Repository record for Secure monitoring system for industrial internet of things using searchable encryption, access control and machine learning (opens in a new tab) Download PDF for Secure monitoring system for industrial internet of things using searchable encryption, access control and machine learning (opens in a new tab)

  15. Applied Sampling and Reconstruction of Signals on the Sphere

    … In addition, the proposed sampling schemes have computationally efficient algorithms for the computation of the SHT and are designed to satisfy all the practical requirements of their applications. The proposed scheme for HRTF measurement and reconstruction has non-dense sampling near the poles …

    anu Repository record for Applied Sampling and Reconstruction of Signals on the Sphere (opens in a new tab)

  16. Responsibility and norms in multiagent systems

    … development of model-checking algorithms and an analysis of their computational complexity.<br/><br/>The responsibility gap is one of the major concerns in multiagent system governance. It refers to the situation in which an outcome happens while no agent can be held responsible. In this thesis, …

    soton Repository record for Responsibility and norms in multiagent systems (opens in a new tab) Download PDF for Responsibility and norms in multiagent systems (opens in a new tab)

  17. Solving Partial Differential Equations Using Artificial Neural Networks

    … parameters and non-homogeneous terms. The computational complexity analysis shows that CPROP compares favorably to existing methods of solution, and that it leads to considerable computational savings when subject to non-stationary environments.</p><p>The CPROP based approach is extended to …

    duke Repository record for Solving Partial Differential Equations Using Artificial Neural Networks (opens in a new tab)

  18. Development of feature extraction algorithms for real-time brain computer interface

    … is parallel computing to address the remaining complexity issues in the selected feature extraction methods. As a result, boosting computing time using a parallel processing technique is theoretically possible and flexible enough for real-time processing. However, in order to further reduce …

    strathclyde Repository record for Development of feature extraction algorithms for real-time brain computer interface (opens in a new tab)

  19. Enabling Efficient Communications Over Millimeter Wave Massive MIMO Channels Using Hybrid Beamforming

    … costs, energy consumption, and system design complexity. The prevalence of adopting mmWave and massive MIMO technologies in next-generation wireless systems necessitates developing agile and cost-efficient hybrid beamforming solutions that match the various use-cases of these systems. In this …

    waterloo Repository record for Enabling Efficient Communications Over Millimeter Wave Massive MIMO Channels Using Hybrid Beamforming (opens in a new tab)

  20. Automated Verification of Object Petri Nets based on Transformation, Unfoldings and SAT Solving

    … This allows for the use of well-established analysis techniques to verify their desirable properties. In contrast, object Petri nets, however, are beneficial to modelling but lack generally adopted verification techniques. The main challenge in this regard is posed by the highly expressive …

    southwales Repository record for Automated Verification of Object Petri Nets based on Transformation, Unfoldings and SAT Solving (opens in a new tab) Download PDF for Automated Verification of Object Petri Nets based on Transformation, Unfoldings and SAT Solving (opens in a new tab)

Page 1 of 2