Search alternatives:
each algorithm » search algorithm (Expand Search), jaya algorithm (Expand Search)
Showing 1 - 6 results of 6 for search 'arbitrary each algorithm*', query time: 0.03s Refine Results
  1. 1

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

    Published 2002
    “…This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. …”
    Get full text
    Get full text
    article
  2. 2

    A quadratic kernel for 3-set packing by Abu-Khzam, Faisal N.

    Published 2017
    “…Such parameterized reductions are known as kernelization algorithms, and each reduced instance is called a problem kernel. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  3. 3

    Crown Structures for Vertex Cover Kernelization by Abu-Khzam, Faisal N.

    Published 2007
    “…These two methods are studied and compared both theoretically and experimentally with each other and with older, more primitive kernelization algorithms. …”
    Get full text
    Get full text
    Get full text
    article
  4. 4

    Using C++ to Calculate SO(10) Tensor Couplings by Bhagwagar, Azadan

    Published 2021
    “…Therefore, there exists an opportunity to leverage the abilities of computer software in order to algorithmically perform these calculations on demand. …”
    Get full text
    article
  5. 5
  6. 6

    Adaptive cooperative control of nonlinear multi-agent systems with uncertain time-varying control directions and dead-zone nonlinearity by Maryam Shahriari-kahkeshi (17269051)

    Published 2021
    “…Simulation and comparison results demonstrate the effectiveness of the proposed algorithm.</p><h2>Other Information</h2><p dir="ltr">Published in: Neurocomputing<br>License: <a href="http://creativecommons.org/licenses/by/4.0/" target="_blank">http://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1016/j.neucom.2021.08.065" target="_blank">https://dx.doi.org/10.1016/j.neucom.2021.08.065</a></p>…”