Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Heuristics" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 111
Tytuł:
Heurystyki w prognozowaniu w przedsiębiorstwie
Heuristics in forecasting in enterprises
Autorzy:
Dittmann, Iwona
Powiązania:
https://bibliotekanauki.pl/articles/425145.pdf
Data publikacji:
2014
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
company
forecasting
heuristics
Opis:
Forecasts built for the needs of the enterprise may be inaccurate. Actual forecast errors (errors ex post) may be greater than the user-defined acceptable prediction errors. One reason for this may be the impact of psychological factors on the forecaster (eg. emotions) and the application of heuristics (usually unconsciously). The purpose of this article was, first, to draw attention to the issue of the possibility of various kinds of heuristics during the construction of forecasts in the company and second to indicate the possibility of eliminating the adverse effects of heuristics on the course and outcome of the forecasting process.
Źródło:
Econometrics. Ekonometria. Advances in Applied Data Analytics; 2014, 4(46); 98-107
1507-3866
Pojawia się w:
Econometrics. Ekonometria. Advances in Applied Data Analytics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Effective Design of the Simulated Annealing Algorithm for the Flowshop Problem with Minimum Makespan Criterion
Autorzy:
Hurkała, J.
Hurkała, A.
Powiązania:
https://bibliotekanauki.pl/articles/309187.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
flowshop
heuristics
makespan
simulated annealing
Opis:
In this paper we address the n-job, m-machine flowshop scheduling problem with minimum completion time (makespan) as the performance criterion. We describe an efficient design of the Simulated Annealing algorithm for solving approximately this NP-hard problem. The main difficulty in implementing the algorithm is no apparent analogy for the temperature as a parameter in the flowshop combinatorial problem. Moreover, the quality of solutions is dependent on the choice of cooling scheme, initial temperature, number of iterations, and the temperature decrease rate at each step as the annealing proceeds. We propose how to choose the values of all the aforementioned parameters, as well as the Boltzmann factor for the Metropolis scheme. Three perturbation techniques are tested and their impact on the solutions quality is analyzed. We also compare a heuristic and randomly generated solutions as initial seeds to the annealing optimization process. Computational experiments indicate that the proposed design provides very good results - the quality of solutions of the Simulated Annealing algorithm is favorably compared with two different heuristics.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 2; 92-98
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concept of using heuristic methods in the optimization of electric power systems
Autorzy:
Gryniewicz-Jaworska, M.
Powiązania:
https://bibliotekanauki.pl/articles/410963.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
electrical power system
optimization
heuristics
Opis:
The dynamic development of information technologies has significantly improved the process of planning and controlling the operation of electrical power systems, nevertheless, we are still looking for methods and solutions which will allow to optimize EPS. The article describes heuristic methods which can be used in electrical power engineering and which will be used to solve OPF (Optimal Power Flow) problems.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 4; 69-72
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of overlay computing systems with many – to - many transmissions
Optymalizacja nakładkowych systemów obliczeniowych z transmisjami wielu do wielu
Autorzy:
Walkowiak, K.
Kasprzak, A.
Andrusieczko, K.
Powiązania:
https://bibliotekanauki.pl/articles/375736.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
optimization
computing systems
overlay
heuristics
Opis:
The problem that this paper investigates, namely, optimization of overlay computing systems, follows naturally from growing need for effective processing and consequently, fast development of various distributed systems. We consider an overlay-based computing system, i.e., a virtual computing system is deployed on the top of an existing physical network (e.g., Internet) providing connectivity between computing nodes. The main motivation behind the overlay concept is simple provision of network functionalities (e.g., diversity, flexibility, manageability) in a relatively cost-effective way as well as regardless of physical and logical structure of underlying networks. The workflow of tasks processed in the computing system assumes that there are many sources of input data and many destinations of output data, i.e., many-to-many transmissions are used in the system. The addressed optimization problem is formulated in the form of an ILP (Integer Linear Programing) model. Since the model is computationally demanding and NPcomplete, besides the branch-and-bound algorithm included in the CPLEX solver, we propose additional cut inequalities. Moreover, we present and test two effective heuristic algorithms: tabu search and greedy. Both methods yield satisfactory results close to optimal.
Zagadnienia dotyczące optymalizacji systemów obliczeń rozproszonych zyskują w ostatnich latach na znaczeniu. Systemy obliczeń rozproszonych rozwijane są w dwóch podstawowych architekturach sieciowych. Po pierwsze, budowane są dedykowane sieci optyczne łączące ośrodki obliczeniowe. Po drugie, wykorzystuje się istniejącą infrastrukturę sieciową (np. Internet) dla budowania systemów pracujących w architekturze nakładkowej (ang. overlay). Ta druga koncepcja zyskuje ostatnio dużą popularność, gdyż umożliwia szybką i tanią realizację systemów obliczeniowych bez potrzeby mocnej współpracy z operatorami sieciowymi. W pracy rozważamy nakładkowy system obliczeniowy umożliwiający transmisje wielu do wielu – dane wejściowe do obliczeń są generowane w wielu źródłach (węzłach sieciowych), następnie po przetworzeniu są przesyłane do wielu odbiorców zainteresowanych wynikami obliczeń. W oparciu o zaproponowaną architekturę systemu, w pracy sformułowano problem optymalizacyjny mający na celu minimalizację kosztów operacyjnych systemu obejmujących koszty obliczeń i koszty przesyłania danych. Model został zapisany jako program całkowitoliczbowy. Z uwagi na fakt, że ten problem należy do klasy problemów NP-zupełnych, zaproponowano dodatkowe odcięcia dla algorytmu podziału i oszacowań oraz dwa efektywne algorytmy heurystyczne. Przeprowadzone eksperymenty obliczeniowe wykazały, że opracowane algorytmy dają wyniki bliskie optymalnym w mniejszym czasie niż algorytm optymalny zawarty w pakiecie CPLEX
Źródło:
Theoretical and Applied Informatics; 2012, 24, 4; 271-291
1896-5334
Pojawia się w:
Theoretical and Applied Informatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamika modeli biznesu
Dynamics of business models
Autorzy:
Sus, Aleksandra
Powiązania:
https://bibliotekanauki.pl/articles/419676.pdf
Data publikacji:
2014
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
business model
dynamic capabilities
heuristics
Opis:
The article focuses on approximating internal factors of the modern organizations success. Accordingly, the attention has been focused on identifying the key points of concentrating on business models, distinguishing features and their dynamic imperatives as well as the tools which implementation may be helpful in the application of effective business models. The key finding of the considerations is the fact that modern organizations more frequently use solutions in the scope of heuristic methods and techniques for solving problems, including the complications associated with business models functioning.
Źródło:
Nauki o Zarządzaniu; 2014, 1(18); 90-99
2080-6000
Pojawia się w:
Nauki o Zarządzaniu
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Economic rationality of students at Poznań universities. Does place of origin matter?
Autorzy:
Barszczewski, Michał Jakub
Żyła, Dawid
Powiązania:
https://bibliotekanauki.pl/articles/2141400.pdf
Data publikacji:
2022-10-10
Wydawca:
Uniwersytet Przyrodniczy w Poznaniu. Wydawnictwo Uczelniane
Tematy:
behavioral economics
heuristics
economic rationality
Opis:
In this paper, economic rationality is measured using the tools of behavioral economics, and the extent to which factors such as field of study, place of origin, gender, interest in economics and economic situation affect this rationality is determined. The authors hypothesize that among these factors, place of origin may be of particular importance due to, among other things, differences in the quality of education between urban and rural areas. In order to verify this hypothesis, Poisson regression and data from a survey conducted on a sample of 232 students of universities in Poznań were used. The developed model proved that the influence of both field of study and interest in economics was statistically significant. Moreover, in some cases place of origin and economic situation (if one’s situation is classified as the worst) were also significant factors. The findings from the survey allowed us to identify the profile of the least economically rational student: a person from a town of up to 250,000 inhabitants, in a field of study within the humanities, in the worst financial situation.
Źródło:
Journal of Agribusiness and Rural Development; 2022, 65, 3; 281-289
1899-5241
Pojawia się w:
Journal of Agribusiness and Rural Development
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the performance analysis of a heuristic approach dedicated to a multiobjective dynamic routing model
Autorzy:
Craveirinha, J.
Martins, L.
Climaco, J. N.
Jorge, L.
Powiązania:
https://bibliotekanauki.pl/articles/309018.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multiple criteria analysis
routing
heuristics
telecommunications
Opis:
In previous works the features and a complete formulation for circuit-switched networks of a multiple objective dynamic routing method (MODR) of periodic state dependent routing type were presented. The aim of the model is to resolve a very complex network bi-objective dynamic routing problem, by recurring to a heuristic for synchronous path selection enabling to obtain a good compromise solution in terms of two network performance measures. In this paper we present a study on the performance of variants of the MODR heuristic of synchronous path selection by using relaxations of the values previously calculated for the two network objective functions. This study permitted the development of an improved version of the initial heuristic. Also a comparison of the analytical values of the network objective functions obtained with selected variants of the initial heuristic with the corresponding results from a known reference method, the real time network routing (RTNR) method, given by a discrete-event simulator for single-service networks, is presented.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 14-23
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristics and biases as sources of negotiators’ errors in the pre-negotiation phase. Review of literature and empirical research
Autorzy:
Adamus-Matuszyńska, Anna
Powiązania:
https://bibliotekanauki.pl/articles/2128470.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet w Białymstoku. Wydawnictwo Uniwersytetu w Białymstoku
Tematy:
heuristics
biases
negotiation
pre-negotiation phase
Opis:
Purpose – Heuristics and biases are simplifying strategies that people (in the analysed issue – negotiators) use in the decision-making process, even when they can take advantage of supporting tools (e.g. Negotiation Support System), which will allow them to make the optimal choice [Wachowicz, 2006]. Many empirical studies have found that decision makers use heuristics and are biased [Bateman, Zeithaml, 1989; Jackson, Dutton, 1988; Kahneman et al. 1982; Zajac, Bazerman, 1991]. Therefore, the question should be asked: are negotiators, like managers (whose decisions were examined), instead of consciously and intentionally using tools supporting decision-making during negotiations, subject to heuristics and cognitive errors? As a consequence of this general question one may ask the specific research questions: (1) What heuristics do the negotiators undergo? (2) How do heuristics influence the decision-making process? (3) How can the impact of heuristics and biases be minimized by taking advantage of negotiation support tools? Research methods – The article is a review of psychological, sociological and management sciences theories, concepts and empirical researches on heuristics and biases. The review was made according to the following categories: (a) theories that recognize the inevitability of heuristics in the decision-making process, (b) theories that attempt to identify opportunities to minimize or even reduce the impact of heuristics on decisions, and (c) those that offer alternative solutions. Results – The summary highlights those heuristics which might occur in the decision-making process in the pre-negotiation phase. Originality/value – There is no research exploring the role of specific heuristics and biases in particular stages of negotiations.
Źródło:
Optimum. Economic Studies; 2020, 3(101); 79-90
1506-7637
Pojawia się w:
Optimum. Economic Studies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The concept of integrated engineering and business (EB) education system
Autorzy:
Charlak, M.
Jakubowski, M. A.
Powiązania:
https://bibliotekanauki.pl/articles/102063.pdf
Data publikacji:
2013
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
engineering educational system
heuristics
innovation
organization
Opis:
In our approach to engineering and business education system an engineer is a man working as creator and user of technical products. We stress that the process of understanding and gaining knowledge of technical reality and creativity of engineers are the essential for EB concept . Next, we describe briefly three perspectives for building the system of innovative product origination as a basis for EB system: 1) designer’s perspective; 2) business perspective. 3) consumer perspective.
Źródło:
Advances in Science and Technology. Research Journal; 2013, 7, 20; 98-103
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrating pivot based search with branch and bound for binary MIPs
Autorzy:
Lokketangen, A.
Woodruff, D.
Powiązania:
https://bibliotekanauki.pl/articles/206756.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
branch and bound
chunking
heuristics
tabu search
Opis:
This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.
Źródło:
Control and Cybernetics; 2000, 29, 3; 741-759
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The use of text models in the formation of heuristics to solve tasks of diagnosing technical objects
Autorzy:
Korostil, J.
Korostil, O.
Powiązania:
https://bibliotekanauki.pl/articles/134938.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
heuristics
diagnostics
monitoring
malfunction
complex technical object
Opis:
This paper describes research related to the use of heuristics in diagnostic tasks of complex technical objects. To build heuristics, the use of text models for technical objects is proposed. Therefore, this paper examines output methods of heuristics from text models and their transformation into logical formulae suitable for use in diagnostic algorithms. Analysis has been carried out for tasks solved during diagnostics, and methods of using heuristics in certain tasks have been reviewed. It is proposed to use heuristics for decision making while implementing certain algorithm steps of monitoring tasks for diagnostic parameters that are solved during diagnostics.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 47 (119); 22-28
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hyper-heuristics for cross-domain search
Autorzy:
Cichowicz, T..
Drozdowski, M.
Frankiewicz, M.
Pawlak, G.
Rytwinski, F.
Wasilewski, J.
Powiązania:
https://bibliotekanauki.pl/articles/201681.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hyper-heuristics
cross-domain heuristic search
HyFlex
Opis:
In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performance of both methods is studied. Useful and interesting experience gained in construction of the hyper-heuristics are presented. Conclusions and recommendations for the future advancement of hyper-heuristic methodologies are discussed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 4; 801-808
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-criteria Gateway Placement Problem in Wireless Sensor Networks
Autorzy:
Czajko, M. M.
Wojciechowski, J. M.
Powiązania:
https://bibliotekanauki.pl/articles/226778.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
wireless sensor network
bi-criteria optimization
heuristics
Opis:
Over the last few years, wireless sensor networks (WSNs) have started to play more and more important role in civil and military applications. A typical sensor network consists of resource-constrained sensing nodes, which monitor environment and send the data to more powerful gateway nodes. The goal of gateway nodes is to aggregate, process and send the data to other gateways or directly to sink nodes. The proper placement of nodes is needed to provide good network operation. Sensing nodes are often placed in a random manner unlike gateways. Gateways, due to their role and cost, are installed rather in a controlled way. In this paper, a bi-criteria gateway placement problem is introduced. The problem is shown to be NP-hard. We formulate it as a linear programming problem, then we develop the Multi-criteria Simulated Allocation (MSAL) heuristic algorithm, for the purpose of cost-effective gateway deployment and power-effective wireless connection management. Finally, we evaluate the efficiency of the algorithm by comparison with the exact method.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 3; 215-221
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methodological Basis of Research in Security Studies
Autorzy:
Czop, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/1832107.pdf
Data publikacji:
2015
Wydawca:
Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie
Tematy:
Methodology
survey
Delphi method
heuristics
scientific interview
Opis:
Security studies are formally functioning for less than five years but have a strong methodological basis, presented shortly in this paper. This include several well-known and broadly-recognized ways of providing the research process, including scientific methods used in social sciences. Author briefly analyses a set of them, showing their advantages and disadvantages and the way they should be used during the whole research process. The need for multidisciplinary studies, including the use of several research tool and techniques, is also stressed.
Źródło:
Security Dimensions; 2015, 15(15); 49-67
2353-7000
Pojawia się w:
Security Dimensions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ARDP: simplified machine learning predictor for missing unidimensional academic results dataset
Autorzy:
Folorunso, Olufemi A.
Akinyede, Olufemi R.
Agbele, Kehinde K.
Powiązania:
https://bibliotekanauki.pl/articles/30148256.pdf
Data publikacji:
2023
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
missingness
predictor variable
training datasets heuristics
unidimensionality
Opis:
In this paper, we present the Academic Results Datasets Predictor (ARDP), for missing academic results datasets, based on chi-squared expected calculation, positional clustering, progressive approximation of relative residuals, and positional averages of the data in a sampled population. Academic results datasets are data originating from inside academic institutions’ results repositories. It is a technique designed specifically for predicting missing academic results. Since the whole essence of data mining is to elicit useful information and gain knowledge-driven insights into datasets, ARDP positions data explorer at this advantageous perspective. ARDP is committed to solve missing academic results dataset problems more quickly over and above what currently obtains. PARD is computed by leveraging on the averages of neighbouring values. The predictor was implemented using Python, and the results show that it is admissible in a minimum of up to 85 percent accurate predictions of the sampled cases. It has been verified that ARDP shows a tendency toward greater precision in providing the best solution to the problems of predictions of missing academic results datasets in universities.
Źródło:
Applied Computer Science; 2023, 19, 1; 47-63
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 111

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