Page 1 Next

Displaying 1 – 20 of 94

Showing per page

A Distance-Based Method for Attribute Reduction in Incomplete Decision Systems

Demetrovics, Janos, Thi, Vu Duc, Giang, Nguyen Long (2013)

Serdica Journal of Computing

There are limitations in recent research undertaken on attribute reduction in incomplete decision systems. In this paper, we propose a distance-based method for attribute reduction in an incomplete decision system. In addition, we prove theoretically that our method is more effective than some other methods.

A Hybrid Approach Combining Local Search and Constraint Programming for a Large Scale Energy Management Problem

Haris Gavranović, Mirsad Buljubašić (2013)

RAIRO - Operations Research - Recherche Opérationnelle

This paper presents a heuristic approach combining constraint satisfaction, local search and a constructive optimization algorithm for a large-scale energy management and maintenance scheduling problem. The methodology shows how to successfully combine and orchestrate different types of algorithms and to produce competitive results. We also propose an efficient way to scale the method for huge instances. A large part of the presented work was done to compete in the ROADEF/EURO Challenge 2010, organized...

A model for opinion agreement and confidence in multi-expert multi-criteria decisión making.

Gerardo Canfora, Luigi Troiano (2004)

Mathware and Soft Computing

In multi-expert multi-criteria decision making problems, we often have to deal with different opinions, different importance of criteria and experts, missing data, unexpressed opinions and experts who are not fully confident with their judgment. All these factors make the problem more difficult to solve, and run the risk of making the model logic less transparent. In this paper, we present a model based on simple assumptions described by logical rules, in order to maintain the model transparency...

A model of decision with linguistic knowledge.

María Teresa Lamata Jiménez (1994)

Mathware and Soft Computing

The aim of this paper is to develop a new aggregating method for the decision problem in which the possible values of rewards are known in linguistic terms. We show new operators for solving this problem, as well as the way in which OWA operators provide us with an adequate framework for representing the optimism degree of the decision maker in case we have no information about the real state.

A multi-granular linguistic model to evaluate the suitability of installing an ERP system.

Pedro José Sánchez, Luis G. Pérez, Francisco Mata, Antonio Gabriel López-Herrera (2005)

Mathware and Soft Computing

The use of Enterprise Resource Planning (ERP) has shown clearly useful and economically profitable in most very large organizations which manage a great deal of data in their information systems. Nevertheless, the decision of installing an ERP system is not easy and it depends on the size, future profits and other features of the companies. The assessments of the parameters (features, aspects) used to evaluate the suitability of the ERP may be vague and imprecise because they are usually perceptions...

A terminal area topology-independent GB-based conflict detection system for A-SMGCS.

Eugenio Roanes Lozano, Rafael Muga, Luis M. Laita, Eugenio Roanes Macías (2004)

RACSAM

A module for conflict detection in A-SMGCS is presented. It supervises the operations that the ground controller has to perform. It doesn?t depend on the topology of the terminal area. The system guarantees the safety of the proposed situation, that is, the impossibility that a conflict arises among aircrafts (and also road vehicles) obeying the signaling. We suppose that the terminal area has stop bars (or semaphores) controlling all intersections and accesses between runways, taxiways, exits,...

About the choice of the variable to unassign in a decision repair algorithm

Cédric Pralet, Gérard Verfaillie (2010)

RAIRO - Operations Research

The decision repair algorithm (Jussien and Lhomme, Artificial Intelligence139 (2002) 21–45), which has been designed to solve constraint satisfaction problems (CSP), can be seen, either (i) as an extension of the classical depth first tree search algorithm with the introduction of a free choice of the variable to which to backtrack in case of inconsistency, or (ii) as a local search algorithm in the space of the partial consistent variable assignments. or (iii) as a hybridisation between local...

About the choice of the variable to unassign in a decision repair algorithm

Cédric Pralet, Gérard Verfaillie (2005)

RAIRO - Operations Research - Recherche Opérationnelle

The decision repair algorithm (Jussien and Lhomme, Artificial Intelligence 139 (2002) 21–45), which has been designed to solve constraint satisfaction problems (CSP), can be seen, either (i) as an extension of the classical depth first tree search algorithm with the introduction of a free choice of the variable to which to backtrack in case of inconsistency, or (ii) as a local search algorithm in the space of the partial consistent variable assignments. or (iii) as a hybridisation between local...

Currently displaying 1 – 20 of 94

Page 1 Next