Basic theory of the analytic hierarchy process: How to make a Decision.
THOMAS L. SAATY (1999)
Revista de la Real Academia de Ciencias Exactas Físicas y Naturales
Similarity:
THOMAS L. SAATY (1999)
Revista de la Real Academia de Ciencias Exactas Físicas y Naturales
Similarity:
R. Ramírez, N. Sadovskaia (1996)
Collectanea Mathematica
Similarity:
The aim of this paper is to construct the analytic vector fields with given as trajectories or solutions. In particular we construct the polynomial vector field from given conics (ellipses, hyperbola, parabola, straight lines) and determine the differential equations from a finite number of solutions.
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:
Michael Hinze, Ulrich Matthes (2009)
Control and Cybernetics
Similarity:
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.
Enrico Bombieri (1971-1972)
Séminaire Bourbaki
Similarity:
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.
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...