Model checking is a fully automatic technique for checking concurrent software properties in which the states of a concurrent system are explored in an explicit or implicit way. However, the state explosion problem limits the size of the models that are ...

Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given system satisfies a liveness property, model checking techniques are ...

This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images. The algorithm is based on a recently developed swarm-intelligence technique, well known as the Bacterial Foraging Optimization (BFO). A ...

BT workforce scheduling problem considers technicians (with different skills) which are assigned to tasks which arrive (partially) dynamically during the day. In order to manage their workforce, BT divides the different regions into several areas. In ...

A major difficulty for anomaly detection lies in discovering boundaries between normal and anomalous behavior, due to the deficiency of abnormal samples in the training phase. In this paper, a novel coevolutionary algorithm which attempts to simulate ...

Genetic Programming (GP) has proved its applicability for time series forecasting in a number of studies. The Dynamic Forecasting Genetic Program (DyFor GP) model builds on the GP technique by adding features that are tailored for the forecasting of ...

In this paper a music composition system based on genetic algorithms (GAs) will be presented. It can create multi-instrumental, guitar-orientated rock music using objective measures for its fitness functions. The output of this system is a song in the ...

The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeable future. There are many versions of FAP, most of them benchmarking-like ...

In this paper, we report on work done evolving Bayesian Networks with Genetic Algorithms. We use a Chain Model GA [19] to induce a Bayesian network model for the real world problem of Prostate Cancer management. Bayesian networks can and have been used ...

Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patterns scheduled in the minimum number of time slots have been obtained. ...

New multimedia embedded applications are increasingly dynamic, and rely on Dynamically-allocated Data Types (DDTs) to store their data. The optimization of DDTs for each target embedded system is a time-consuming process due to the large design space of ...

Military missions are turning to more complicated and advanced automation technology for maximum endurance and efficiency as well as the minimum vital risks. The path planners which generate collision-free and optimized paths are needed to give ...

In this paper, we introduce a methodology for the approximation of optimal solutions for a resource allocation problem in the domain of Grid scheduling on High Performance Computing systems. In detail, we review a real-world scenario with decentralized, ...

This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the algorithm fulfills and optimizes multiple criteria which (1) are calculated ...

This paper proposes a new approach for biologically inspired computing on the basis of Gene Regulatory Networks. These networks are models of genes and dynamic interactions that take place between them. The differential equation representations of such ...

Differential Evolution (DE) has recently emerged as a simple yet very powerful technique for real parameter optimization. This article describes an application of DE for the design of Fractional-Order Proportional-Integral-Derivative (FOPID) Controllers ...

We here describe a novel formalism for estimating the structural similarity of formulas that are evolved by a genetic programming (GP) based identification process. This method takes into account several aspects of structure tree comparison that are ...

The 0/1 knapsack problem is one of the most exhaustively studied NP-hard combinatorial optimization problems. Many different approaches have been taken to obtain an approximate solution to the problem in polynomial time. Here we consider the biobjective ...

This paper presents a new method for solving discrete deceptive problems using a genotype to phenotype mapping where a new replacement and shift operator is applied. The method is evaluated using different deceptive problems. Experimental results show ...

This paper aims at comparing Genetic Algorithm (GA) and Guided Local Search (GLS) methods so as to scrutinize their behaviors. Authors apply the GLS program with the Fast Local Search (FLS), developed at University of Essex, and implement a genetic ...