Displaying similar documents to “Knowledge discovery in data using formal concept analysis and random projections”

Solving the Task Assignment Problem with a Variable Neighborhood Search

Kratica, Jozef, Savić, Aleksandar, Filipović, Vladimir, Milanović, Marija (2010)

Serdica Journal of Computing

Similarity:

In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed...

Synthesis of finite state machines for CPLDs

Robert Czerwiński, Dariusz Kania (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented...

Genetic Algorithm Approach for Solving the Task Assignment Problem

Savić, Aleksandar, Tošić, Dušan, Marić, Miroslav, Kratica, Jozef (2008)

Serdica Journal of Computing

Similarity:

This research was partially supported by the Serbian Ministry of Science and Ecology under project 144007. The authors are grateful to Ivana Ljubić for help in testing and to Vladimir Filipović for useful suggestions and comments. In this paper a genetic algorithm (GA) for the task assignment problem (TAP) is considered.An integer representation with standard genetic operators is used. Computational results are presented for instances from the literature, and compared to...

CAPS in Z(2,n)

Kurz, Sascha (2009)

Serdica Journal of Computing

Similarity:

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.

Weighting quantitative and qualitative variables in clustering methods.

Karina Gibert, Ulises Cortés (1997)

Mathware and Soft Computing

Similarity:

Description of individuals in ill-structured domains produces messy data matrices. In this context, automated classification requires the management of those kind of matrices. One of the features involved in clustering is the evaluation of distances between individuals. Then, a special function to calculate distances between individuals partially simultaneously described by qualitative and quantitative variables is required. In this paper properties and details of the metrics...