The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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.
F. Z. Hadjam, C. Moraga, M. K. Rahmouni (2007)
Mathware and Soft Computing
Similarity:
J. L. Vega (2010)
Boletín de Estadística e Investigación Operativa. BEIO
Similarity:
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...
Cherukuri Aswani Kumar (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper our objective is to propose a random projections based formal concept analysis for knowledge discovery in data. We demonstrate the implementation of the proposed method on two real world healthcare datasets. Formal Concept Analysis (FCA) is a mathematical framework that offers a conceptual knowledge representation through hierarchical conceptual structures called concept lattices. However, during the design of a concept lattice, complexity plays a major role.
THOMAS L. SAATY (1999)
Revista de la Real Academia de Ciencias Exactas Físicas y Naturales
Similarity:
Józef H. Przytycki (1983)
Collectanea Mathematica
Similarity:
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...
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...