Search academic resources

Subjects / keywords: Ordenadores; Programación; Algoritmos

Subjects / keywords: WIRTH, NIKLAUS; PRENTICE-HALL; 005.12 W799a

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

Subjects / keywords: WILDE, DANIEL U; PRENTICE-HALL; 005.113 W671i

Subjects / keywords: SEDGEWICK, ROBERT; ADDISON WESLEY; 518.1 S448a2

Subjects / keywords: THEUNIVERSIY OF CHICAGO PRESS; 616.988 G345g

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

Evolutionary computation (EC) has been recently recognized as a research field, which studies a new type of algorithms: Evolutionary Algorithms (EAs). These algorithms process populations of solutions as opposed to most ...

The study of earliness and tardiness penalties in scheduling is a relatively recent area of research. In the past, traditionally the emphasis was put on regular measures that are nondecreasing in job completion times suc...

Evolutionary algorithms (EAs) offer a robust approach to problem solving. EAs are extremely flexible and can be extended by incorporating alternative approaches to favour he search process. One way is to hybridize an evo...

Even if simply stated the travelling salesman problem (TSP) is one of the most studied NP-hard problems. Many algorithms have been proposed to solve TSP. Dynamic programming and branch and bound techniques provided the g...

The travelling salesman problem (TSP) is a NP-hard problem. Techniques as either Branch and Bound or Dynamic Programming supplied the global optimum solution for instances with more than 7000 cities. But, ther needed mor...

Evolutionary algorithms (EAs) have been successfully applied to scheduling problems. Current improvements towards convergence issues in EAs include incest prevention and multiplicity features. A multiplicity feature all...

A new issue for combinatorial optimization problems is to incorporate local search into the framework of evolutionary algorithms, leading to hybrid evolutionary algorithms. With the hybrid approach, evolutionary algorith...

Improvements in evolutionary algorithms (EAs) consider multirecombination, allowing multiple crossover operations on a pair of parents (MCPC, multiple crossovers per couple) or on a set of multiple parents (MCMP, multipl...

This work summarizes results when facing the problem of allocating a number of nonidentical tasks in a parallel system. The model assumes that the system consists of a number of identical processors and that only one tas...

Evolutionary Computation is an emergent field, which provides new heuristics to function optimization where traditional approaches make the problem computationally intractable. Exploration and exploitation of solution i...

We present an evolutionary algorithm that evolves a population of local approximators in order to fit an unknown function. The evolutionary algorithm performs a simultaneous learning of simple local approximators togethe...

A job shop can be seen as a multi-operation model where jobs follows fixed routes, but not necessarily the same for each job. Job Shop Scheduling (JSS) attempts to provide optimal schedules according to some criterion. C...

In the Laboratory of Research and Development on Computer Science of the National University of La Plata, a face recognition system has been developed. This article describes a series of testings based on parallel proces...

Scheduling is an active area of research in applied artificial intelligence. Scheduling problems typically comprise several concurrent (and often conflicting) goals, and several resources which may be allocated in order ...

Video compression is one of the topics included in the area of images digital processing. The book gives an introduction to algorithms and architectures used in standard video and audio compression Facultad de Informáti...

Recommender systems apply knowledge discovery techniques to the problem of making personalized recommendations for information, products or services during a liveinteraction. These systems, especially the k-nearest neigh...