On the analytic representation of the Leximin ordering and its application to flexible constraint propagation
โ Scribed by Ronald R. Yager
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 775 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
โฆ Synopsis
We discuss the basic formulation of constraint propagation problems and extend it to the flexible constraint propagation environment where constraints are represented as fuzzy subsets. Some methods for ordering alternative solutions with respect to a collection of flexible constraints are discussed along with their drawbacks. Among the methods introduced is the Leximin method where we note its lack of an analytic formulation. With the aid of the ordered weighted averaging (OWA) operator we suggest an analytic formulation for the Leximin method. Some properties of this formulation are provided. We then describe the application of this new formulation for the Leximin method to situations in which the constraints are describable in a linear fashion. We show how we can use mixed integer programming techniques to find an optimal solution.
๐ SIMILAR VOLUMES
## Abstract Graphical representation of a DNA sequence is a powerful tool for basic biological research. Based on the ordered dinucleotides, we propose a novel three dimensional (3D) graphical representation without circuit or degeneracy. Simultaneously, we derive the projection curve of the 3D gra
## Abstract In the application of layered neural networks to practical problems, a high generalization power is required. This paper discusses a method of improving the generalization power of neural networks. The knowledge of the object to be learned is assumed to include the fact that the output