Search academic resources

In static scheduling problems it is assumed that jobs are ready at zero time or before processing begins. In dynamic scheduling problems a job arrival can be given at any instant in the time interval between zero and a l...

Interest on dynamic multimodal functions risen over the last years since many real problems have this feature. On these problems, the goal is no longer to find the global optimal, but to track their progression through t...

We describe O(n) time algorithms for finding the minimum weighted dominating induced matching of chordal, dually chordal, biconvex, and claw-free graphs. For the first three classes, we prove tight O(n) bounds on the max...

Abstract In this paper, we propose a modified version of the shifted VM algorithms where the matrices have the form where and are symmetric positive semi definite matrices, usually , is obtained from to satisfy the shift...

Abstract The Purpose of this research is the development Direct Search Methods for minimizing the objective function; The Developed Methods reduces the approach time to the minimum through two techniques: 1) by reducing...

Chronic heart failure (CHF) is a common syndrome, in which heart failure with preserved left ventricular ejection fraction (HFpEF) predominates. The diagnosis of this particular phenotype of СHF currently remains challe...

This study tackles the processes scheduling problem of multiprocessor and describing two algorithms from many algorithms for an array of dependent processes, which are represented by, direct a cj'clic Graph on different ...

With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The degree of performance of time-sharing systems de...

ABSTRACT The packet classification technique play an important role for many internet advanced services that require the capability to distinguish traffic in different flows, such as routers and security services like fi...

ABSTRACT The present study aimed at comparing predictive performance of some data mining algorithms (CART, CHAID, Exhaustive CHAID, MARS, MLP, and RBF) in biometrical data of Mengali rams. To compare the predictive capab...

Abstract Background Protein-protein interaction (PPI) network-based protein function prediction algorithms, which use the guilt-by-association principle, are widely applied in medical and human domains, but they are comp...

We introduce and discuss a new computational model for the HermiteLagrange interpolation with nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it....

Prescribed-time algorithms based on time-varying gains may have remarkable properties, such as regulation in a user-prescribed finite time that is the same for every nonzero initial condition and that holds even under ma...

Formulation of the problem. In scientific research in sociology, education, physics, chemistry and other sciences, methods of correlation analysis are used. Correlation coefficients are used to determine the existence of...

In this paper, firstly, based on Halpern iterative algorithm, Mann iterative algorithm, shrinking projection algorithm and hybrid midpoint rules, we introduce two modified strong convergence algorithms for nonexpansive m...

In this book the authors present a complete state-of-the art in the field. Then they give an overall vision about the diverse varieties of MOEAs (Multi-Objetive Evolutionary Algorithms) and their performance. Important a...

One of the major breakthroughs in VLSI technology has been its ability to implement signal processing algorithms and architectures onto cost-effective ASIC and DSP chips. Works in this area are highly interdisciplinary;...

Identical parallel machines problems (Pm) involve task assignments to the system's resources (a machine bank in parallel). The basic model consists of m machines and n tasks. The tasks are assigned according to the avail...

Proportional selection (PS), as a selection mechanism for mating (reproduction with emphasis), selects individuals according to their fitness. Consequently the probability of an individual to obtain a number of offspring...

Traditionally in Genetic Algorithms, the mutation probability parameter maintains a constant value during the search. However, an important difficulty is to determine a priori which probability value is the best suited f...

In this preliminary study the Flow Shop Scheduling Problem (FSSP) is solved by hybrid Evolutionary Algorithms. The algorithms are obtained as a combination of an evolutionary algorithm, which uses the Multi-Inver-Over op...

Selection mechanisms favour reproduction of better individuals imposing a direction on the search process. According to this it is expected that the effective number of offspring of an individual in the next generation w...

In the restricted single-machine common due date problem, the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties. This problem, even in its simplest formulatio...

In a production system it is usual to stress minimum tardiness to achieve higher client satisfaction. According to the client relevance, job processing costs and requirements, and various other considerations, a weight ...