Cerca risorse accademiche

Materie / parole chiave: Ordenadores; Programación; Algoritmos

Materie / parole chiave: WIRTH, NIKLAUS; PRENTICE-HALL; 005.12 W799a

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...

Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multipl...

La localización de servicios (“Facility location” en inglés) pretende encontrar el emplazamiento de uno o más centros (servicios) de modo que se optimice una determinada función objetivo. Dicha función objetivo pu...

The development of digital technologies, capable of analysing massive amounts of data, has led to the widespread implementation of data processing technologies and automated decision-making processes in many areas of hum...

Materie / parole chiave: WILDE, DANIEL U; PRENTICE-HALL; 005.113 W671i

Materie / parole chiave: SEDGEWICK, ROBERT; ADDISON WESLEY; 518.1 S448a2

Materie / parole chiave: THEUNIVERSIY OF CHICAGO PRESS; 616.988 G345g

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...

There are many different forms of recombination operators available in literature. However, it is difficult to determine a priori which one is the best suited for a given problem. This issue encourages us to propose an a...

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...

Classi cation and regression ensembles sho w generalization capabilities that outperform those of single predictors. We present here a further ev aluation of tw o algorithms for ensemble construction recently proposed by...

We present the results of our work on applying genetic algorithms combined with a discrete event simulation to the problem of convoy scheduling. We show that this approach can automatically remove conflicts from a convoy...

This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we st...

In this work, we study the behavior of several cellular memetic algorithms (cMAs) when solving the satisfiability problem (SAT). The proposed cMAs are the result of including hybridization techniques in dif- ferent struc...

Document classification has already been widely studied. In fact, some studies compared feature selection techniques or feature space transformation whereas some others compared the performance of different algorithms. R...

In genetic algorithms selection mechanisms aim to favour reproduction of better individuals imposing a direction on the search process. It does not create new individuals; instead it selects comparatively good individual...