-
1
A quadratic kernel for 3-set packing
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
2
A kernelization algorithm for d-Hitting Set
منشور في 2010"…In this paper, a kernelization algorithm for the 3-Hitting Set problem is presented along with a general kernelization for d -Hitting Set. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
3
An improved kernelization algorithm for r-Set Packing
منشور في 2010"…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
4
-
5
Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System
منشور في 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. …"
-
6
Complexities of special matrix multiplication problems
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
7
-
8
Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems
منشور في 2009احصل على النص الكامل
doctoralThesis -
9
On the disk dimension of planar graphs
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
10
Fast, effective vertex cover kernelization
منشور في 2017احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
11
-
12
Efficient Seismic Volume Compression using the Lifting Scheme
منشور في 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. …"
احصل على النص الكامل
article -
13
Modelling of pollutant transport in compound open channels
منشور في 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). …"
احصل على النص الكامل
احصل على النص الكامل
masterThesis
