Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "decision algorithms" wg kryterium: Temat


Tytuł:
Decisions algorithms and flow graphs; a rough set approach
Autorzy:
Pawlak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/307789.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
rough sets
decision algorithms
flow graphs
data mining
Opis:
This paper concerns some relationship between Bayes' theorem and rough sets. It is revealed that any decision algorithm satisfies Bayes' theorem, without referring to either prior or posterior probabilities inherently associated with classical Bayesian methodology. This leads to a new simple form of this theorem, which results in new algorithms and applications. Besides, it is shown that with every decision algorithm a flow graph can be associated. Bayes' theorem can be viewed as a flow conservation rule of information flow in the graph. Moreover, to every flow graph the Euclidean space can be assigned. Points of the space represent decisions specified by the decision algorithm, and distance between points depicts distance between decisions in the decision algorithm.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 98-101
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Supporting the Manufacturing Process of Metal Products with the Methods of Artificial Intelligence
Autorzy:
Wilk-Kołodziejczyk, D.
Powiązania:
https://bibliotekanauki.pl/articles/355822.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
manufacturing process of metal products
decision algorithms
implementation of IT solutions
Opis:
The aim of this research programme was to develop a series of methods and solutions to support the decision-making process in foundry and materials engineering. The specific problems discussed included the selection of methods for data processing and knowledge representation formalisms, backed up by the creation of decision algorithms based on contemporary achievements of artificial intelligence, tailored to the needs of foundry industry and metallurgy. The manufacturing process of metal items is associated with many aspects, which affect the quality of end product. For process engineers responsible for the supervising and planning of production, an important feature is, among others, the diversified nature of numerous aspects of the knowledge acquisition and integration from distributed sources of information which, when made available in an appropriate manner, can support the improvement of manufacturing process.
Źródło:
Archives of Metallurgy and Materials; 2016, 61, 4; 1995-1998
1733-3490
Pojawia się w:
Archives of Metallurgy and Materials
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytm postępowania decyzyjnego w działalności innowacyjnej przedsiębiorstw
Algorithm of decision making procedure in enterprises innovative activity
Autorzy:
Sałek, R.
Powiązania:
https://bibliotekanauki.pl/articles/325436.pdf
Data publikacji:
2014
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
algorytmy decyzyjne
modele decyzyjne
innowacyjność
zarządzanie przedsiębiorstwem
decision algorithms
decision-making models
innovativeness
enterprise management
Opis:
Innowacyjność współczesnych przedsiębiorstw w dużym stopniu odzwierciedla ich działalność rynkową, stanowi również wyznacznik ich możliwości rozwojowych. Procesy decyzyjne stanowią fundament dla prawidłowego funkcjonowania każdego przedsiębiorstwa. Ich ustalony i sprawny przebieg często decyduje o sukcesie lub porażce w rozwiązywaniu danego problemu. Zastosowanie odpowiednich narzędzi, które w sposób czytelny wspomagają podejmowanie decyzji, w znaczący sposób może się przyczyniać do tworzenia skutecznej strategii innowacyjności.
Innovativeness of modern enterprises a large extent reflects their market activities, and is also a determinant of their development opportunities. Decision-making processes are the foundation for the proper functioning of any enterprise. Their defined and efficient course often determines between success and failure in solving a given problem. Application of appropriate tools, which clearly support the decision-making in a meaningful way, could contribute for creating a successful innovation strategy.
Źródło:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska; 2014, 68; 243-253
1641-3466
Pojawia się w:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of Algorithms for Decision Making Problems and Preservation of α-properties of Fuzzy Relations in Aggregation Process
Autorzy:
Bentkowska, U.
Balicki, K.
Powiązania:
https://bibliotekanauki.pl/articles/950912.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
decision making algorithms
fuzzy relations
properties of fuzzy relations
aggregation function
Opis:
In the paper the problem of preservation of properties of fuzzy relations during aggregation process is considered. It means that properties of fuzzy relations R1, … , R2 on a set X are compared with properties of the aggregated fuzzy relation RF = F(R1, … , R2), where R is a function of the type F ∶ [0, 1]n → [0, 1]. There are discussed α-properties (which may be called graded properties - to some grade R) as reflexivity, irreflexivity, symmetry, asymmetry, antisymmetry, connectedness and transitivity, where α ∈ [0, 1]. Fuzzy relations with a given graded property are analyzed (there may be diverse grades of the same property) and the obtained grade of the aggregated fuzzy relation is provided. There is also discussed the „converse” problem. Namely, relation RF = F(R1, … , Rn) is assumed to have a graded property and the properties of relations R1, … , Rn are examined (possibly with some assumptions on F). Presented here considerations have possible applications in decision making algorithms. This is why interpretation of the considered graded properties and possible potential in decision making is presented.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 2; 25-39
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Koncepcja przydziału zleceń transportowych z giełd transportowych
The concept of allocation of the transport orders acquired from the transport exchange market
Autorzy:
Woźniak, W.
Powiązania:
https://bibliotekanauki.pl/articles/309928.pdf
Data publikacji:
2017
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
giełda transportowa
zlecenia transportowe
rentowność zleceń transportowych
podejmowanie decyzji
algorytmy decyzyjne
freight exchange
transport order
profitability of transport orders
decision making
decision algorithms
Opis:
W artykule przedstawiono proces oceny rentowności zleceń transportowych pozyskiwanych z giełd transportowych. Zaproponowano metodę podejmowania decyzji, uwzględniający algorytm szybkiego wyboru zlecenia rentownego na podstawie kalkulacji kosztów pełnych przedsiębiorstwa transportowego.
This paper covers the issue of the choice of the transport offers derived from the freight exchange market by transport companies. For this purpose two algorithms were suggested that were developed in order to increase the pace of the decision making process.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2017, 18, 6; 1294-1297, CD
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Navigators’ Behavior in Traffic Separation Schemes
Autorzy:
Pietrzykowski, Z.
Wołejsza, P.
Magaj, J.
Powiązania:
https://bibliotekanauki.pl/articles/117042.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Maritime Traffic
Traffic Separation Scheme
Traffic Density
Vessel Traffic
Decision Support Algorithms
Navigators’ Behavior
Collision Situation
decision support system
Opis:
One of the areas of decision support in the navigational ship conduct process is a Traffic Separation Scheme. TSSs are established in areas with high traffic density, often near the shore and in port approaches. The main purpose of these schemes is to improve maritime safety by channeling vessel traffic into streams. Traffic regulations as well as ships behavior in real conditions in chosen TSSs have been analyzed in order to develop decision support algorithms.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 121-126
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning decision rules using a distributed evolutionary algorithm
Autorzy:
Kwedlo, W.
Krętowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/1986918.pdf
Data publikacji:
2002
Wydawca:
Politechnika Gdańska
Tematy:
decision rule learning
distributed evolutionary algorithms
Opis:
A new parallel method for learning decision rules from databases by using an evolutionary algorithm is proposed. We describe an implementation of EDRL-MD system in the cluster of multiprocessor machines connected by Fast Ethernet. Our approach consists in a distribution of the learning set into processors of the cluster. The evolutionary algorithm uses a master-slave model to compute the fitness function in parallel. The remiander of evolutionary algorithm is executed in the master node. The experimental results show, that for large datasets our approach is able to obtain a significant speed-up in comparison to a single processor version.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 3; 483-492
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Joint allocation and transportation problem in supply network optimisation
Autorzy:
Filcek, G.
Powiązania:
https://bibliotekanauki.pl/articles/407403.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
supply networks
optimization
convex optimization
heuristic algorithms
decision support systems
Opis:
The paper concerns joint allocation and transportation as an optimization problem in selected supply networks. The network consists of a set of suppliers of the raw material, a set of production units and a set of product receivers. The raw material is treated as fast perishing good like vegetables or fruits. The production units are described by time models. In the optimization process, the time of the production and cost of the transportation is taken into account. The objective function is in general non-convex function of raw material allocation and transportation plans of the raw material and the product. To solve the problem considered, exact and heuristic algorithms have been developed and presented. To solve convex problems, solver Lingo developed by Lindo systems is proposed. The idea of a computer decision supported system integrating all presented algorithms is presented as well as four numerical examples illustrating some properties of the assumed supply network model.
Źródło:
Management and Production Engineering Review; 2012, 3, 3; 3-10
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving Markov decision processes by d-graph algorithms
Autorzy:
Kátai, Z.
Powiązania:
https://bibliotekanauki.pl/articles/205688.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Markov decision processes
dynamic programming
graph representation
graph algorithms
optimization problems
Opis:
Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
Źródło:
Control and Cybernetics; 2012, 41, 3; 577-593
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision Support System for Designing Effective Noise Hazard Prevention Strategies
Autorzy:
Asawarungsaengkul, K.
Nanthavanij, S.
Chalidabhongse, J.
Powiązania:
https://bibliotekanauki.pl/articles/90636.pdf
Data publikacji:
2007
Wydawca:
Centralny Instytut Ochrony Pracy
Tematy:
decision support system
noise hazard prevention
genetic algorithms
noise control
capital budgeting
Opis:
A decision support system for designing effective noise hazard prevention (NHP) strategies is proposed. NHP consists of four modules: (a) database, (b) input, (c) algorithms, and (d) solution. The user can choose among single-, two-, and three-approach solution procedures. Heuristic and genetic algorithms are used to determine appropriate noise controls (NCs). From the given noise condition and NC budget, NHP recommends a minimum-cost NHP strategy that prevents any worker’s daily noise exposure from exceeding the permissible level. If the budget is insufficient, NHP is able to search for a feasible noise hazard strategy that requires a minimum NC budget.
Źródło:
International Journal of Occupational Safety and Ergonomics; 2007, 13, 4; 451-470
1080-3548
Pojawia się w:
International Journal of Occupational Safety and Ergonomics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving Procedure for Multiobjective Dynamic Problem with Changeable Group Hierarchy of Stage Criteria Dependent on the Stage of the Process
Autorzy:
Trzaskalik, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/578483.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
Algorithms
Dynamic programming
Multiple-criteria decision making
Algorytmy
Programowanie dynamiczne
Wielokryterialne podejmowanie decyzji
Opis:
We consider multiobjective, multistage discrete dynamic decision processes. In this paper we propose an interactive procedure which allows to solve the problem of optimal control of such a process in the case when the decision maker has determined a group hierarchy of stage criteria. This hierarchy is changeable and depends on the stage of the process. The proposed algorithm is illustrated by a numerical example.
Źródło:
Multiple Criteria Decision Making; 2016, 11; 168-186
2084-1531
Pojawia się w:
Multiple Criteria Decision Making
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Very Fast Non-Dominated Sorting
Autorzy:
Smutnicki, C.
Rudy, J.
Żelazny, D.
Powiązania:
https://bibliotekanauki.pl/articles/375948.pdf
Data publikacji:
2014
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
parallel algorithms
Pareto sorting
computational complexity
GPU computing
multiple criteria decision analysis
NSGA-II
Opis:
A new and very efficient parallel algorithm for the Fast Non-dominated Sorting of Pareto fronts is proposed. By decreasing its computational complexity, the application of the proposed method allows us to increase the speedup of the best up to now Fast and Elitist Multi-Objective Genetic Algorithm (NSGA-II) more than two orders of magnitude. Formal proofs of time complexities of basic as well as improved versions of the procedure are presented. The provided experimental results fully confirm theoretical findings.
Źródło:
Decision Making in Manufacturing and Services; 2014, 8, 1-2; 13-23
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method of approximating Pareto sets for assessments of implicit Pareto set elements
Autorzy:
Kaliszewski, I.
Powiązania:
https://bibliotekanauki.pl/articles/970402.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiple criteria decision making
bi-criteria problems
Pareto set
efficiency
convex function approximation
sandwich algorithms
Opis:
Deriving efficient variants in complex multiple criteria decision making problems requires optimization. This hampers greatly broad use of any multiple criteria decision making method. In multiple criteria decision making Pareto sets, i.e. sets of efficient vectors of criteria values corresponding to feasible decision alternatives, are of primal interest. Recently, methods have been proposed to calculate assessments for any implicit element of a Pareto set (i.e. element which has not been derived explicitly but has been designated in a form which allows its explicit derivation, if required) when a finite representation of the Pareto set is known. In that case calculating respective bounds involves only elementary operations on numbers and does not require optimization. In this paper the problem of approximating Pareto sets by finite representations which assure required tightness of bounds is considered for bicriteria decision making problems. Properties of a procedure to derive such representations and its numerical behavior are investigated.
Źródło:
Control and Cybernetics; 2007, 36, 2; 367-381
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Customized crossover in evolutionary sets of safe ship trajectories
Autorzy:
Szłapczyński, R.
Szłapczyńska, J.
Powiązania:
https://bibliotekanauki.pl/articles/331257.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm ewolucyjny
unikanie kolizji statków
system wspomagania decyzji
evolutionary algorithms
ship collision avoidance
decision support systems
Opis:
The paper presents selected aspects of evolutionary sets of safe ship trajectories-a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned within one minute, which enforces speeding up the optimisation process. During the development of the method the authors tested various problem-dedicated crossover operators to obtain the best performance. The results of that research are given here. The paper includes a detailed description of these operators as well as statistical simulation results and examples of experiment results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 999-1009
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimising rig design for sailing yachts with Evolutionary Multi-objective Algorithm
Autorzy:
Pawłusik, Mikołaj
Szłapczyński, Rafał
Karczewski, Artur
Powiązania:
https://bibliotekanauki.pl/articles/1573832.pdf
Data publikacji:
2020
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
sailing yacht rig optimization
Bermuda sloop
Multi-Objective Evolutionary Algorithms (MOEA)
Multi Criteria Decision Making (MCDM)
Opis:
The paper presents a framework for optimising a sailing yacht rig using Multi-objective Evolutionary Algorithms and for filtering obtained solutions by means of a Multi-criteria Decision Making method. A Bermuda sloop with discontinuous rig is taken under consideration as a model rig configuration. It has been decomposed into its elements and described by a set of control parameters to form a responsive model which can be used for optimisation purposes. Considering the contradictory nature of real optimisation objectives, a multi-objective approach has been chosen to address this issue. Once the optimisation process is over, a Multi-criteria Decision Making method based on a w-dominance relation is applied for filtering out the most interesting solutions from the obtained Pareto set. The proposed method has been implemented, and selected results are provided and discussed.
Źródło:
Polish Maritime Research; 2020, 4; 36-49
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies