Cerca risorse accademiche

Niche formation allows evolutionary algorithms to be used when the location and maintenance of multiple solutions appertaining to diverse areas of the phenotypic space is required. Consequently the application field can ...

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

Evolutionary Algorithms (EAs) became a powerful tool for environments where an optimization is needed or where an adaptive behaviour of a system is necessary. Computer Systems have been evolving rapidly during the last ...

In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is know...

Allocation of the components (tasks) of a parallel program to processors in a multiprocessor or a multicomputer system take full advantage of the computational power provided by the system. Evolutionary approaches has b...

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

Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems. Scheduling problems can pose...

Our interest is to define evolutionary algorithms to solve Constraint Satisfaction Problems (CSP), which indlude benefits of taditional resolution methods of CSPs as well as inherent characteristics of these kind of prob...

A variety of optimization problems in fields such as production operations in manufacturing industry, parallel and distributed systems, logistics and traffic can be summarized within the general class of scheduling probl...

This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrain...

Scheduling concerns the allocation of limited resources for tasks over time. It is a process of making decisions that has, as a goal, the optimization of one or more objectives. Frequently, the main objective to be minim...

Multiobjective optimization, also known as vector-valued criteria or multicriteria optimization, have long been used in many application areas where a problem involves multiple objectives, often conflicting, to be met or...

The flow shop scheduling problem (FSSP) has held the attention of many researchers. In a simplest usual situation, a set of jobs must follow the same route to be executed on a set of machines (resources) and the main obj...

Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear Diophantine Equations. Algorit...