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ę "resource optimization" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 20
Tytuł:
Using Polymatrix Extensive Stackelberg Games in Security – Aware Resource Allocation and Task Scheduling in Computational Clouds
Autorzy:
Jakóbik, A.
Wilczyński, A.
Powiązania:
https://bibliotekanauki.pl/articles/309395.pdf
Data publikacji:
2017
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
cloud computing
resource optimization
Stackelberg equilibrium
Stackelberg games
Opis:
In this paper, the Stackelberg game models are used for supporting the decisions on task scheduling and resource utilization in computational clouds. Stackelberg games are asymmetric games, where a specific group of players’ acts first as leaders, and the rest of the players follow the leaders’ decisions and make their decisions based on the leader’s actions. In the proposed model, the optimal schedules are generated under the security criteria along with the generation of the optimal virtual machines set for the scheduled batch of tasks. The security criteria are defined as security requirements for mapping tasks onto virtual machines with specified trust level. The effectiveness of the proposed method has been verified in the realistic use cases with in the cloud environment with OpenStack and Amazon Cloud standards.
Źródło:
Journal of Telecommunications and Information Technology; 2017, 1; 71-80
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dobór zespołów projektowych z wykorzystaniem metod stochastycznych
Project team selection using stochastic methods
Autorzy:
Twardochleb, Michał
Powiązania:
https://bibliotekanauki.pl/articles/432408.pdf
Data publikacji:
2014
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
stochastic optimization
selection of project teams
resource optimization
Monte Carlo
Opis:
The paper presents the possibility of application of stochastic methods in supporting the selection of project team members. According to research of M. Belbin an effective collaboration of members of the project team requires 8 team roles (describing the soft skills) in its composition, which will enable the occurrence of the synergy effect. For the purpose of the reasearch, the original software was developed, which uses stochastic methods in the process of assembling teams that meet these criteria. The paper presents the results of experiments based on anonymized surveys conducted among students of different faculties. Teams obtained thorough conducted simulations fulfilled the criterion of completeness of team roles.It was pointed out that the use of stochastic methods in supporting the process of selection of employees in project teams may contribute to improving the efficiency of resource allocation through the appropriate assignation of roles and responsibilities, for example, to avoid a situation where a qualified professional would be attached to the team, wherein his potential would be wasted.
Źródło:
Informatyka Ekonomiczna; 2014, 1(31); 223-236
1507-3858
Pojawia się w:
Informatyka Ekonomiczna
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Knowledge Management in Hospitals. Review of Literature
Zarządzanie wiedzą w szpitalach. Przegląd literatury
Autorzy:
Bobruk, Marcin
Wiśniewski, Zbigniew
Kot, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/29551855.pdf
Data publikacji:
2023
Wydawca:
Uczelnia Łazarskiego. Oficyna Wydawnicza
Tematy:
knowledge management
healthcare systems
clinical decision-making
technology in healthcare
medical knowledge dissemination
organizational effectiveness
resource optimization
zarządzanie wiedzą
systemy opieki zdrowotnej
podejmowanie decyzji klinicznych
technologia w ochronie zdrowia
efektywność organizacyjna
optymalizacja zasobów
Opis:
This article examines the role of Knowledge Management (KM) in hospitals and healthcare organizations. It underscores the importance of KM in enhancing healthcare delivery in the face of digital transformation, an aging population, and the need for cost-effective practices. The review highlights critical factors such as leadership, culture, and technology, which are pivotal for KM implementation. Additionally, it addresses the significance of both tacit and explicit knowledge, particularly in medical know-how and clinical judgment. The dual purpose of this review is to synthesize current research and to pinpoint research opportunities in KM practices within Polish academic hospitals, thereby offering a foundation for future empirical work.
W artykule zaprezentowano rolę zarządzania wiedzą (ZW) w szpitalach i innych organizacjach opieki zdrowotnej. Omówiono znaczenie ZW w poprawie dostarczania usług zdrowotnych w obliczu transformacji cyfrowej, starzenia się populacji i konieczności efektywnego zarządzania kosztami. Zwrócono uwagę na kluczowe czynniki, takie jak wsparcie przywódcze, kultura uczenia się i infrastruktura technologiczna, które są niezbędne do implementacji ZW. Dodatkowo omówiono znaczenie wiedzy zarówno utajonej, jak i jawnej, szczególnie w kontekście medycznego know-how i osądu klinicznego. Podwójny cel tego przeglądu to syntezowanie obecnego stanu badań dotyczących ZW w szpitalach oraz wskazanie luk i możliwości dla przyszłych badań empirycznych nad ZW w akademickich szpitalach w Polsce. Oferuje to fundament teoretyczny i praktyczny dla przyszłych prac badawczych.
Źródło:
Review of Medical Practice; 2023, XXIX, 3; 72-80
2956-4441
2956-445X
Pojawia się w:
Review of Medical Practice
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A computational study of approximation algorithms for a minmax resource allocation problem
Autorzy:
Przybysławski, B.
Kasperski, A.
Powiązania:
https://bibliotekanauki.pl/articles/406619.pdf
Data publikacji:
2012
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
discrete optimization
robust optimization
resource allocation
approximation algorithms
Opis:
A basic resource allocation problem with uncertain costs has been discussed. The problem is to minimize the total cost of choosing exactly p items out of n available. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a solution. This problem is known to be NP-hard, but several approximation algorithms exist. The aim of this paper is to investigate the quality of the solutions returned by these approximation algorithms. According to the results obtained, the randomized algorithms described are fast and output solutions of good quality, even if the problem size is large.
Źródło:
Operations Research and Decisions; 2012, 22, 2; 35-43
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neighbourhood properties in some single processor scheduling problem with variable efficiency and additional resources
Autorzy:
Gorczyca, M.
Janiak, A.
Janiak, W.
Powiązania:
https://bibliotekanauki.pl/articles/375991.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
optimization
resource allocation
neighbourhood
Opis:
In the paper, we consider a problem of scheduling a set of tasks on a single processor. Each task must be preprocessed before it can be started on a processor. The efficiency of preprocessing is variable, i.e., the rate of the task preprocessing depends on the amount of continuously divisible resource allotted to this task. This dependency is given by concave, continuous, non-negative and strictly increasing function of the resource amount. The total consumption of resource at each moment is upper bounded. The objective is to minimize the maximum task completion time. The considered problem is NP-hard. Such a problem appears, e.g., in steel mill systems, where ingots (before hot rolling on the blooming mill) have to achieve the required temperature in the preheating process in soaking pits. Some new properties of the problem are proved. These properties are used to construct the procedure for evaluation of the neighbourhood. The procedure is proposed to improve the efficiency of algorithms based on the neighbourhood concept, such as metaheuristics. The computational experiment is conducted to examine the efficiency of the proposed procedure. The described approach can be easily used in the other discrete-continuous scheduling problems.
Źródło:
Decision Making in Manufacturing and Services; 2011, 5, 1-2; 5-17
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The scalarization approach for multi-objective optimization of network resource allocation in distributed systems
Autorzy:
Wesołowski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/92817.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
distributed system
resource allocation
multi-objective optimization
Opis:
The paper presents a multi-objective optimization framework to the network resource allocation problem, where the aim is to maximize the bitrates of data generated by all agents executed in a distributed system environment. In the proposed approach, the utility functions of agents may have different forms, which allows a more realistic modeling of phenomena occurring in computer networks. A scalarizing approach has been applied to solve the optimization problem.
Źródło:
Studia Informatica : systems and information technology; 2016, 1-2(20); 39-52
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing the Use of Human Resources in Industrial-Service Enterprises
Autorzy:
Tychoniuk, A.
Wyczółkowski, R.
Stuchlý, V.
Powiązania:
https://bibliotekanauki.pl/articles/2064891.pdf
Data publikacji:
2018
Wydawca:
STE GROUP
Tematy:
optimization
human resource allocation
competency
selection of employees
genetic algorithms
Opis:
The optimal use of resources available in the enterprise is important regardless of the size of the company and the industry in which it operates. Enterprises are therefore forced constantly to make alternative choices related to the allocation of available resources and to optimize these choices. The article addresses the problem of the approach to optimizing the use of human resources particularly, the use of extra employee qualifications e.g., manual skills, pressure resistance, work precision, the ability to read schematic diagrams, etc. in the context of technical requirements for a given task. This is extremely important in the situation when subsequent works are individual and the conditions in which they will be performed, cannot be predicted in 100%, they may differ from those that have been implemented so far, and at the same time numerous orders of various nature are being implemented. In this situation, an accurate prediction of the requirements posed by new tasks and the appropriate selection of teams executing them can have an impact on the effectiveness of the task completion process. In the article, this problem is presented on the example of a medium-sized service enterprise operating in the industry-related sector operating basically on tender procedures and tender contests. The works are carried out on the customer's premises, often with new customers or in new field conditions. Thus, the success of the undertaking depends mainly on the optimal selection of employees with appropriate qualifications and competences. The example of an investment task is used to show a method of identifying characteristics relevant to the task as well as selection of employees in order to use the capabilities of human teams better. Technical aspects of task implementation and an employees team selection with regard to the absolutely required technical qualifications as well as the behavioral and physical skills necessary for its implementation are taken into account. The described method can be used for future tasks regardless of the changing conditions of their implementation. The intention of the authors is to develop a tool supporting the decision-making process in this area, so that it can also be used by managers with lower technical competences.
Źródło:
Multidisciplinary Aspects of Production Engineering; 2018, 1, 1; 857--865
2545-2827
Pojawia się w:
Multidisciplinary Aspects of Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Resource Allocation Optimization in Critical Chain Method
Autorzy:
Pawiński, G.
Sapiecha, K.
Powiązania:
https://bibliotekanauki.pl/articles/106140.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
Critical Chain Project Management
CCPM
resource allocation
optimization algorithm
RCPSP
Opis:
The paper presents resource allocation optimization in Critical Chain Project Management (CCPM). The cheapest project schedule is searched with respect to time constraints. The algorithm originally developed for the hardware-software co-design of heterogeneous distributed systems is adapted to work with human resources and CCPM method. The results of the optimization showed significant efficiency of the algorithm in comparison with a greedy algorithm. On average, the optimization gives 14.10% of cost reduction using the same number of resources. The gain varies depending on the number of resources and the time constraints. Advantages and disadvantages of such an approach are also discussed.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 1; 17-29
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Telecommunications network design and max-min optimization problem
Autorzy:
Ogryczak, W.
Pióro, M.
Tomaszewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/309010.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network design
resource allocation
fairness
lexicographic optimization
lexicographic max-min
Opis:
Telecommunications networks are facing increasing demand for Internet services. Therefore, the problem of telecommunications network design with the objective to maximize service data flows and provide fair treatment of all services is very up-to-date. In this application, the so-called max-min fair (MMF) solution concept is widely used to formulate the resource allocation scheme. It assumes that the worst service performance is maximized and the solution is additionally regularized with the lexicographic maximization of the second worst performance, the third one, etc. In this paper we discuss solution algorithms for MMF problems related to telecommunications network design. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model (mathematical programme). However, one can formulate a sequential lexicographic optimization procedure. The basic procedure is applicable only for convex models, thus it allows to deal with basic design problems but fails if practical discrete restrictions commonly arriving in telecommunications network design are to be taken into account. Then, however, alternative sequential approaches allowing to solve non-convex MMF problems can be used.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 43-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Optimal Strategy of Resource Sharing in a Case of State-toggling Agents
Autorzy:
Wójtowicz, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/1373705.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
hard real-time systems
scheduling
shared resource
optimization
round-robin
Opis:
This paper presents an optimal scheduling solution for a case of agents sharing a resource. The amount of resource can not satisfy all agents at once and in case of runout there is a penalty. Each agent randomly toggle its state between requiring and not requiring the resource. Using the knowledge of previous state and probability of change, the scheduling algorithm is able to calculate optimal number of concuring agents for one turn, that minimizes possibility of collision yet provides as much throughput as possible. Several different scheduling strategies are tested. The optimal solution adapts automatically to the value of probability of change. Further experiments show that optimality is retained if only the average probability of a set of agents is known. A case of practical application is provided.
Źródło:
Schedae Informaticae; 2015, 24; 211-220
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimum enterprise combination in a maize based cropping system in the Southern Agricultural Zone of Adamawa State, Nigeria
Optymalne połączenie przedsiębiorstw w oparciu o system uprawy kukurydzy w południowej, rolnej strefie stanu Adamawa, Nigeria
Autorzy:
Jonah, Labaga
Umar, H. Suleiman
Galadima, Onuk
Ibrahim, Hussaini Yusuf
Powiązania:
https://bibliotekanauki.pl/articles/2216473.pdf
Data publikacji:
2020
Wydawca:
Politechnika Bydgoska im. Jana i Jędrzeja Śniadeckich. Wydawnictwo PB
Tematy:
limited farm resource
optimization
profit maximization
maksymalizacja zysku
ograniczone zasoby gospodarstwa
optymalizacja
Opis:
Background. Maize is a major cereal consumed by nearly all Nigerian households and accounts for about 43% of calorie intake. Rapid population growth and urbanization coupled with infrastructural developments have made agricultural resources very limited in supply and constrained maize production. This necessitates the need for an optimum enterprise combination in a maize based cropping system to guarantee the profit maximization objective of maize farming households. Hence, the study investigated optimum enterprise combinations in maize based cropping systems in the Southern Agricultural Zone of Adamawa State, Nigeria. This study would be of benefit to maize farmers that may need information on maize based enterprise combination that give optimum level of returns. Material and methods. A multistage sampling technique was used to select 130 respondents. Data were collected during the 2018/2019 cropping season and analysed using descriptive statistics, Gross Margin (GM) analysis and the Linear Programming (LP) model . Results. Result of the distribution of the respondents on the basis of maize based enterprises in the study area showed the largest group (40%) of the respondents practiced sole maize enterprises. The gross margin analysis revealed that seven enterprises (maize/rice, maize/groundnut, maize/sorghum, maize/soybean, maize/sugarcane, maize/yam and maize/benniseed) were sustainable as their respective total revenue was higher than their total variable cost. The linear programming model recommends that each farmer grows a mix of three crops in an area ratio of 6.15:3.35:1.50 for maize/soybean, maize/benniseed and maize/ sorghum, respectively, to give a gross margin of N 544,999.04 (1,192.41 €) for crops grown on an area of 11 ha. Conclusion. The study recommended crop mixtures based on their hectarage allocation as prescribed in the optimum farm plans would have generated income as follows: maize/soybean (N 367,449.89 (804.15 €)), maize/benniseed (N 104,034.25 (227.85 €)) and maize/sorghum (N 73,514.89 (160.85 €)). The recommended crop mixtures would have increased the farmers’ gross margin by 17%.
Kukurydza jest głównym zbożem spożywanym przez prawie wszystkie nigeryjskie gospodarstwa domowe i jest źródłem około 43% kalorii. Szybki wzrost liczby ludności i urbanizacja w połączeniu z rozwojem infrastruktury sprawiły, że zasoby rolne pod względem podaży i produkcji kukurydzy są bardzo ograniczone. Istnieje zatem potrzeba optymalnego połączenia przedsiębiorstw w systemie upraw opartym na kukurydzy, aby zagwarantować cel maksymalizacji zysków gospodarstw domowych. Dlatego w ramach prezentowanych badań określono optymalne kombinacje przedsiębiorstw w systemach upraw opartych na kukurydzy w południowej, rolniczej strefie stanu Adamawa w Nigerii. Do badań wybrano 130 respondentów spośród 1336 zarejestrowanych plantatorów kukurydzy pochodzących z 16 społeczności rolniczych. Zastosowano metodę wielostopniowego doboru próby. Dane zebrano w sezonie zbiorów 2018/2019 i przeanalizowano za pomocą statystyk opisowych, analizy marży brutto i modelu programowania liniowego. Wynik rozmieszczenia respondentów ze względu na przedsiębiorstwa na badanym obszarze wykazał, że największa grupa badanych przedsiębiorstw (40%) opierała produkcję tylko na kukurydzy. Siedem grup przedsiębiorstw (kukurydza/ryż, kukurydza/orzeszki ziemne, kukurydza/sorgo, kukurydza/soja, kukurydza/trzcina cukrowa, kukurydza/ignam i kukurydza/sezam) było zrównoważonych, ponieważ ich całkowity dochód był wyższy niż ich całkowite koszty zmienne. Model programowania liniowego rekomenduje, aby każdy rolnik uprawiał trzy mieszanki upraw w stosunku powierzchniowym 6,15:3,35:1,50 odpowiednio dla kukurydzy/soi, kukurydzy/sezamu i kukurydzy/sorga, co daje marżę brutto 544 999,04 N (1,192.41 €) dla upraw uprawianych na obszarze 11 ha. W badaniach wykazano, że mieszanki upraw, zgodnie z zaleceniami optymalnych planów gospodarstw, przyniosłyby następujące dochody: kukurydza/soja (367 449,89 N (804.15 €)), kukurydza/nasiona sezamu (104 034,25 N (227.85 €)) i kukurydza/sorgo (73 514,89 N (160.85 €)). Zalecane mieszanki upraw mogą zwiększyć marżę brutto rolników o 17%.
Źródło:
Acta Scientiarum Polonorum. Agricultura; 2020, 19, 4; 169-180
1644-0625
Pojawia się w:
Acta Scientiarum Polonorum. Agricultura
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic control of a class of discrete event systems using a state reconstruction algorithm
Autorzy:
Martinelli, F.
Nicosia, S.
Valigi, P.
Powiązania:
https://bibliotekanauki.pl/articles/205600.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
discrete events systems
optymalizacja
sterowanie
teoria systemów
Kanbaal systems
optimization
ordinal optimization
production control
resource allocations
sample path analysis
Opis:
The problem of dynamic control of Discrete Event Dynamic Systems (DEDS) is addressed in this paper as a dynamic optimization problem : some resources must be allocated to the system in order to optimize a performance function which is assumed time-varying. The control scheme exploits a state reconstruction algorithm to compute an estimate of the performance for perturbed sample paths. The algorithm is based on the use of data extracted from the observation of the system and allows to accurately reconstruct its state behavior, for resource allocations different from the nominal one. The proposed control scheme is then used for dynamic allocation of buffer capacities in mamlfaeturing systems, such as Kanban systems. A parallel implementation of the whole algorithm is also mentioned.
Źródło:
Control and Cybernetics; 2000, 29, 1; 275-294
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of IS/IT, process and constraint management in optimization of business processes
Autorzy:
Basl, J.
Powiązania:
https://bibliotekanauki.pl/articles/117962.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
information system
enterprise information system
enterprise resource planning (ERP)
business process optimization
constraint management
Opis:
The paper deals with business process based on the IS/ICT (information systems, information and communication technology) applications, mainly ERP (Enterprise Resource Planning) and APS (Advanced Planning and Scheduling) software packages, process and constraint management. The analysis of the current ERP and APS offer in the Czech market is presented. The second part of the paper deals with the principles of the innovation of IS/ICT in enterprise and with the approaches to the its effectiveness
Źródło:
Applied Computer Science; 2005, 1, 1; 93-106
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of Call Admission Control for UTRAN
Autorzy:
Wągrowski, M.
Ludwin, W.
Powiązania:
https://bibliotekanauki.pl/articles/307858.pdf
Data publikacji:
2011
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
blocking and dropping of calls
call admission control
measurement based optimization
radio resource management
traffic analysis
Opis:
This paper addresses the traffic's grade of service indicators: call blocking and dropping rates as well as the optimization of their mutual relation, corresponding to the call admission control procedure configuration. In the presented results of simulations authors showed opportunities for the CAC load threshold adaptation according to the traffic volume and user mobility changes observed in the mobile radio network.
Źródło:
Journal of Telecommunications and Information Technology; 2011, 3; 74-80
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Speeding-up convolutional neural networks: A survey
Autorzy:
Lebedev, V.
Lempitsky, V.
Powiązania:
https://bibliotekanauki.pl/articles/201708.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
convolutional neural networks
resource-efficient computation
algorithm optimization
splotowe sieci neuronowe
efektywne zasoby obliczeniowe
optymalizacja algorytmu
Opis:
Convolutional neural networks (CNN) have become ubiquitous in computer vision as well as several other domains, but the sheer size of the modern CNNs means that for the majority of practical applications, a significant speed up and compression are often required. Speeding-up CNNs therefore have become a very active area of research with multiple diverse research directions pursued by many groups in academia and industry. In this short survey, we cover several research directions for speeding up CNNs that have become popular recently. Specifically, we cover approaches based on tensor decompositions, weight quantization, weight pruning, and teacher-student approaches. We also review CNN architectures designed for optimal speed and briefly consider automatic architecture search.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 6; 799-811
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 20

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