Cerca risorse accademiche

Multimodal optimization is an always present topic in Computer Systems and Networks design and implementation. - Evolutionary Computation is an emergent field which provides new heuristics to function optimization where ...

The aItemative proposed and known as MCPC [6] has improved the perfonnance of the original Holland's Genetic Algorithms in order to obtain good quality solutions in less execution time. But, it's brought out an important...

Evolutionary Computation (EC) have been applied to a great number of optimisation problems with some success, specially in fields such as production operations in manufacturing industry, parallel and distributed systems,...

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

This paper presents an encoding technique that is common for many different logic synthesis problems. It enables us to construct a system of Boolean functions, and then to decompose this system into sub-systems in such a...

Determining an optimal schedule to minimize the completion time of the last job abandoning the system (makespan) becomes a very difficult problem when there are more than two machines in the flow shop. Due both to its ec...

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

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

Over the past three decades extensive search have been done on pure m-machine flow shop problems. Many researchers faced the Flow Shop Scheduling Problem (FSSP) by means of well-known heuristics which, are successfully ...

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

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

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

Determining an optimal schedule to m1mm1ze the completion time of the last job abandoning the system (makespan) become a very difficult problem when there are more than two machines in the flow shop. Due both to its econ...

This paper evaluates the application of the computational intelligence methodologies in a nonlinear process identification. The different intelligent methodologies utilized are evolutionary computation (hybrid genetic al...

La adaptación de parámetros y operadores es una de las más importantes y promisorias áreas de investigación en la computación evolutiva. La idea es ajustar el algoritmo al problema, mientras el problema se resuelve...

In this paper several evolutionary computation paradigms in process identification and control are utilized. The following methodologies are addressed: i) genetic algorithms (with floating point representation), ii) hybr...

This work studies the solution space topology of the Traveling Salesman Problem or TSP, as a bi-objective optimization problem. The concepts of category and range of a solution are introduced for the first time in this ...

We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the ...

This paper presents a new traffic engineering multitreemultiobjective multicast routing algorithm (M-MMA) that solves for the first time the GMM model for Dynamic Multicast Groups. Multitree traffic engineering uses seve...

Fire modelling is used by engineers and scientists to understand and to predict possible fire behaviour. Empirical, semi-empirical, and physical models have been developed to predict wildfire behaviour. Any of these can ...

A parallel program, when running, can be conceived a set of parallel components (tasks) which can be executed according to sorne precedence relationship. In this case efficient scheduling of tasks permits to take full.a...

In evolutionary algorithms based on genetics, the crossover operation creates individuals by interchanging genes. On the other side selection mechanisms aim to favour reproduction of better individuals imposing a directi...

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