Results 11 to 20 of about 459,449 (308)
Efficient algorithms for polyploid haplotype phasing [PDF]
Background Inference of haplotypes, or the sequence of alleles along the same chromosomes, is a fundamental problem in genetics and is a key component for many analyses including admixture mapping, identifying regions of identity by descent and ...
Dan He +3 more
doaj +2 more sources
Efficient Strategies Algorithms for Resource Allocation Problems
Strategic modelling with a panoramic view plays an important role in decision-making problems. It offers the possibility of generating different solutions before making a decision. This is particularly relevant in critical situations.
Yacouba Adama Koné +3 more
doaj +2 more sources
Efficient Algorithms for Permutation Arrays from Permutation Polynomials [PDF]
We develop algorithms for computing permutation polynomials (PPs) using normalization, so-called F-maps and G-maps, and the Hermite criterion. This allows for a more efficient computation of PPs for larger degrees and for larger finite fields.
Sergey Bereg +3 more
doaj +2 more sources
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algorithms for deciding whether a given sentence, made up from words of a given dictionary, is a spoonerism or not.
Hans-Joachim Böckenhauer +4 more
openaire +5 more sources
Efficient Algorithms for Battleship
We consider an algorithmic problem inspired by the Battleship game. In the variant of the problem that we investigate, there is a unique ship of shape $S \subset Z^2$ which has been translated in the lattice $Z^2$. We assume that a player has already hit the ship with a first shot and the goal is to sink the ship using as few shots as possible, that is,
Crombez, Loïc +2 more
openaire +5 more sources
Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays
This paper presents a self-contained factorization for the delay Vandermonde matrix (DVM), which is the super class of the discrete Fourier transform, using sparse and companion matrices. An efficient DVM algorithm is proposed to reduce the complexity of
Sirani M. Perera +2 more
doaj +1 more source
Adjacency Maps and Efficient Graph Algorithms
Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In
Gabriel Valiente
doaj +1 more source
Comparative Analysis of Load Balancing Algorithms for Efficient Task Scheduling in Cloud Computing [PDF]
: In the field of information technology cloud computing is a recently developed technology. In such a complicated system, an effective load balancing scheme is critical in order to meet peak user demands and deliver high-quality services. Load balancing
Yazeed Al Moayed, Sawsan Rabaya
core +1 more source
Novel and Efficient Randomized Algorithms for Feature Selection
Feature selection is a crucial problem in efficient machine learning, and it also greatly contributes to the explainability of machine-driven decisions. Methods, like decision trees and Least Absolute Shrinkage and Selection Operator (LASSO), can select ...
Zigeng Wang +2 more
doaj +1 more source
08492 Abstracts Collection – Structured Decompositions and Efficient Algorithms [PDF]
From 30.11. to 05.12.2008, the Dagstuhl Seminar 08492 ``Structured Decompositions and Efficient Algorithms '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and
Teschke, Gerd +4 more
core +1 more source

