Search alternatives:
iii algorithm » rd algorithm (Expand Search)
Showing 1 - 13 results of 13 for search 'arbitrary iii algorithm', query time: 0.04s Refine Results
  1. 1
    A quadratic kernel for 3-set packing

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

    Published 2017
    “…We present a reduction procedure that takes an arbitrary instance of the 3-Set Packing problem and produces an equivalent instance whose number of elements is bounded by a quadratic function of the input parameter. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  2. 2
    A kernelization algorithm for d-Hitting Set

    A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

    Published 2010
    “…In this paper, a kernelization algorithm for the 3-Hitting Set problem is presented along with a general kernelization for d -Hitting Set. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  3. 3
    An improved kernelization algorithm for r-Set Packing

    An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

    Published 2010
    “…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  4. 4
    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem

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

    Published 2002
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  5. 5
    Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System

    Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System by Mohamed Ali Zeddini (22047920)

    Published 2024
    “…<p dir="ltr">The arbitrary selection of the Crow Search Algorithm (CSA) parameters, the Awareness Probability (AP) and the Flight Length (fl) results in poor convergence performance and efficiency even if the CSA performs well when solving global optimization problems. …”
    Save to List
    Saved in:
  6. 6
    Complexities of special matrix multiplication problems

    Complexities of special matrix multiplication problems by Takche, J.

    Published 1988
    “…This paper develops optimal algorithms to multiply an n × n symmetric tridiagonal matrix by: (i) an arbitrary n × m matrix using 2nm − m multiplications; (ii) a symmetric tridiagonal matrix using 6n − 7 multiplications; and (iii) a tridiagonal matrix using 7n −8 multiplications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  7. 7
    An explicit finite-difference scheme for wave propagation in nonlinear optical structures

    An explicit finite-difference scheme for wave propagation in nonlinear optical structures by Al-Sunaidi, M. A.

    Published 2001
    article
    Save to List
    Saved in:
  8. 8
    Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems

    Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems by Sadjadi, Hossein

    Published 2009
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  9. 9
    On the disk dimension of planar graphs

    On the disk dimension of planar graphs by Abu-khzam, Faisal

    Published 2011
    “…More significantly, we devise a direct and highly practical linear-time algorithm to decide whether an arbitrary graph has fixed disk dimension k or less. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  10. 10
    Fast, effective vertex cover kernelization

    Fast, effective vertex cover kernelization by Abu-Khzam, F.N.

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  11. 11
    Crown Structures for Vertex Cover Kernelization

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

    Published 2007
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  12. 12
    Efficient Seismic Volume Compression using the Lifting Scheme

    Efficient Seismic Volume Compression using the Lifting Scheme by Khene, M. F.

    Published 2000
    “…In addition, the lifting scheme offers: 1) a dramatic reduction of the required auxiliary memory, 2) an efficient combination with parallel rendering algorithms to perform arbitrary surface and volume rendering for interactive visualization, and 3) an easy integration in the parallel I/O seismic data loading routines. …”
    Get full text
    article
    Save to List
    Saved in:
  13. 13
    Modelling of pollutant transport in compound open channels

    Modelling of pollutant transport in compound open channels by Chatila, Jean Georges

    Published 1998
    “…These equations are derived in three dimensions (3-D), however, in order to simplify the problem and ease the computational effort, the equations are integrated over the depth (depth-averaged). …”
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:

Search Tools: