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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 141
Tytuł:
Frequency planning and ramifications of coloring
Autorzy:
Eisenblätter, Andreas
Grötschel, Martin
Koster, Arie
Powiązania:
https://bibliotekanauki.pl/articles/743541.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
frequency assignment
graph coloring
Opis:
This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are T-coloring and list coloring. To model all the subtleties, the techniques of integer programming have proven to be very useful.The ability to produce good frequency plans in practice is essential for the quality of mobile phone networks. The present algorithmic solution methods employ variants of some of the traditional coloring heuristics as well as more sophisticated machinery from mathematical programming. This paper will also address this issue.Finally, this paper discusses several practical frequency assignment problems in detail, states the associated mathematical models, and also points to public electronic libraries of frequency assignment problems from practice. The associated graphs have up to several thousand vertices and range form rather sparse to almost complete.
Źródło:
Discussiones Mathematicae Graph Theory; 2002, 22, 1; 51-88
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization on permutations: related structures, problems interrelation, heuristic compositions, applications
Autorzy:
Miatselski, M.
Powiązania:
https://bibliotekanauki.pl/articles/298118.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
heuristic algorithm
heuristics composition
optimization on permutations
assignment problem
quadratic assignment problem
Opis:
A heuristics based approach to practical solving theoretically intractable combinatory and network problems is discussed. Compound heuristics (heuristics compositions) are suggested to be more efficient procedures for real size problem instances. Some aspects of the heuristics compositions topic are illustrated by optimum permutation problems. We describe a uniform presentation of the chief types of the problems and their interrelations, including the relation “to be a special case of a problem”. We consider a number of algebraic structures and combinatory constructions on permutation sets and present an inclusion chain of these constructions. The chain enables us to establish and clarify many interrelations for the minimum permutation problems, with algorithmic and complexity aspects taken into account. We also concern the applications of some problems as well.
Źródło:
Technical Sciences / University of Warmia and Mazury in Olsztyn; 2018, 21(1); 37-47
1505-4675
2083-4527
Pojawia się w:
Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Aspects of the Application of Genetic Algorithm for Solving the Assignment Problem of Tasks to Resources in a Transport Company
Autorzy:
Izdebski, Mariusz
Jacyna, Marianna
Powiązania:
https://bibliotekanauki.pl/articles/504281.pdf
Data publikacji:
2014
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
assignment problem
genetic algorithm
optimization
Opis:
The article defines the assignment problem of tasks to resources in a transport company. The paper describes mathematical model of a transport system taking into account the assignment of vehicles to the tasks. It also provides stages of creation of the genetic algorithm for solving the assignment problem in the transport company.
Źródło:
Logistics and Transport; 2014, 21, 1; 13-20
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant algorithm for AP-N aimed at optimization of complex systems
Autorzy:
Mikulik, J.
Zajdel, M.
Powiązania:
https://bibliotekanauki.pl/articles/375987.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
assignment problem
ant algorithm
optimization
Opis:
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
Źródło:
Decision Making in Manufacturing and Services; 2010, 4, 1-2; 29-36
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Location of Processor Allocator and Job Scheduler and Its Impact on CMP Performance
Autorzy:
Zydek, D.
Chma, G.
Shawky, A.
Selvaraj, H.
Powiązania:
https://bibliotekanauki.pl/articles/227230.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
CMP
PA
JS
energy
assignment
Opis:
High Performance Computing (HPC) architectures are being developed continually with an aim of achieving exascale capability by 2020. Processors that are being developed and used as nodes in HPC systems are Chip Multiprocessors (CMPs) with a number of cores. In this paper, we continue our effort towards a better processor allocation process. The Processor Allocator (PA) and Job Scheduler (JS) proposed and implemented in our previous works are explored in the context of its best location on the chip. We propose a system, where all locations on a chip can be analyzed, considering energy used by Network-on-Chip (NoC), PA and JS, and processing elements. We present energy models for the researched CMP components, mathematical model of the system, and experimentation system. Based on experimental results, proper placement of PA and JS on a chip can provide up to 45% NoC energy savings.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 1; 9-14
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem
Autorzy:
Sierksma, Gerard
Powiązania:
https://bibliotekanauki.pl/articles/1340570.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Assignment Polytope
Traveling Salesman Polytope
Opis:
The 3-Opt procedure deals with interchanging three edges of a tour with three edges not on that tour. For n≥6, the 3-Interchange Graph is a graph on 1/2(n-1)! vertices, corresponding to the hamiltonian tours in K_n; two vertices are adjacent iff the corresponding hamiltonian tours differ in an interchange of 3 edges; i.e. the tours differ in a single 3-Opt step. It is shown that the 3-Interchange Graph is a hamiltonian subgraph of the Symmetric Traveling Salesman Polytope. Upper bounds are derived for the diameters of the 3-Interchange Graph and the union of the 2- and the 3-Interchange Graphs. Finally, some new adjacency properties for the Asymmetric Traveling Salesman Polytope and the Assignment Polytope are given.
Źródło:
Applicationes Mathematicae; 1993-1995, 22, 3; 351-358
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Factoring in Business Operations
Autorzy:
Baranowski, Bartosz
Powiązania:
https://bibliotekanauki.pl/articles/23050964.pdf
Data publikacji:
2023
Wydawca:
Fundacja Instytut Nauki o Polityce
Tematy:
assignment of receivables
factoring
financial liquidity
Opis:
Assignment of receivables as an institution of current civil law is rooted in ancient legal systems. The abovementioned institution was introduced to the Polish legal system under the Code of Obligations of 27 October 1933. This solution occurs in various specific forms serving various legal and economic goals, beginning with the satisfaction of claims of individuals, to securing a claim, to improvement of financial liquidity of the assignor. Thanks to the constant development of the above legal institution it functions in numerous legal systems and constitutes a real support in securing business transactions and making them more efficient.
Źródło:
Polish Journal of Political Science; 2023, 9, 2; 22-32
2391-3991
Pojawia się w:
Polish Journal of Political Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search for target-radar assignment
Autorzy:
Hindsberger, M.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/205568.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
assignment
combinatorial optimization
metaheuristics
tabu search
Opis:
In this paper the problem of assigning air-defense illumination radars to enemy targets is presented. A Tabu Search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches. Implementation and experimental aspects are discussed. It is argued that Tabu Search could be used in near realtime decision making systems.
Źródło:
Control and Cybernetics; 2000, 29, 3; 701-724
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multidimensional personnel selection through combination of TOPSIS and Hungary assignment algorithm
Autorzy:
Safari, H.
Cruz-Machado, V.
Sarraf, A. Z.
Maleki, M.
Powiązania:
https://bibliotekanauki.pl/articles/406851.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
TOPSIS
Hungary assignment
personnel selection
NGT
Opis:
This paper proposes an effective solution based on combined TOPSIS and Hungary assignment approach to help companies that need to assign personnel to different departments. An extension of TOPSIS (technique for order performance by similarity to ideal solution) combined by Hungary assignment algorithm is represented for this purpose. According to decrease resistance of employee opposite of recruitment of new employee, Decision criteria are obtained from the nominal group technique (NGT) and managers of each departments has been involved in decision making process. In the presented solution, managers of four departments have been involved in evaluating four candidates for their department and data is analyzed by TOPSIS and at the end, an effective fit between personnel and their corresponding department is presented.
Źródło:
Management and Production Engineering Review; 2014, 5, 1; 42-50
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zbywanie roszczeń o naprawienie szkody wyrządzonej czynem niedozwolonym. Ratio legis, treść normatywna oraz przyszłość uregulowania art. 449 k.c.
Assignability of Claims for Personal Injuries Caused by Torts. Ratio Legis, Present and Future of the Regulation
Autorzy:
Strugała, Radosław
Powiązania:
https://bibliotekanauki.pl/articles/519072.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Jagielloński. Fundacja Utriusque Iuris
Tematy:
assignment
personal injuries
claims for damages
Opis:
The aim of the paper is to present an alternative interpretation of the article 449 of the Polish Civil Code. In contrast to the most common, literal interpretation thereof, the paper offers a purposive interpretation taking into account ratio legis of the provision at stake. This tool enables to cast away some interpretative doubts which are constantly raised in the literarure. For inastance, it leads to the conclusion that the acknowledgement of debt which (according to the article 449 of the Polish Civil Code) renders the claims for damages assignable shall be limited to the acknowledgement in the strict meaning of the term, that is to the acknowledgement understood as a contract between creditor and debtor, and shall determine a sum of the acknowledged claim. The paper concludes that the article 449 of the Polish Civil Code, thanks to its purposive interpretation, may effectively protect assignors from assigning their claims for damages for the price which is far lower than the value of damages to which the assignor was entitled. This conclusion put in the context of ongoing works on the new law regulating the compensation agencies makes the article 9 of this law (which exludes the possibility of assignement of claims for damages) redundant.
Źródło:
Forum Prawnicze; 2019, 4 (54); 38-49
2081-688X
Pojawia się w:
Forum Prawnicze
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Umowa przelewu wierzytelności a podatek dochodowy od osób prawnych
Autorzy:
Bocheńska, Justyna
Powiązania:
https://bibliotekanauki.pl/articles/617600.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
taxation
assignment
receivables
cesja
wierzytelność
podatek
Opis:
Taxation of assignment of receivables with corporate income tax does not have the legislation applied in a uniform manner. Situation is variable due to the subject. The Act of Corporate Income Tax forms different regulations for objects whose assignment of receivables is a subject of business activity and for those whose not. This subject matter become an object of contrary judicial decision and tax interpretations due to incomplete regulations in Polish legal system.
Zagadnienia dotyczące opodatkowania umowy przelewu wierzytelności podatkiem dochodowym od osób prawnych należą do kwestii bardzo istotnych. Sytuacja jest jednak różna w zależności od podmiotów. W przypadku podmiotów, których przedmiotem działalności gospodarczej jest obrót wierzytelnościami, najważniejszą regulacją na gruncie ustawy o podatku dochodowym od osób prawnych, dotyczącą sposobu powstania przychodu, jest art. 12 ust. 3 i 3a, natomiast w przypadku tych, które zbywają wierzytelności własne i nie prowadzą działalności gospodarczej w tym zakresie, jest to art. 14 ust. 1. Tematyka ta jest przedmiotem niejednokrotnie sprzecznych ze sobą orzeczeń i interpretacji sądów administracyjnych, dlatego można uznać, że zagadnienia te, choć istotne, nadal nie są w pełni uregulowane w polskim systemie prawnym.
Źródło:
Studenckie Zeszyty Naukowe; 2016, 19, 31
1506-8285
Pojawia się w:
Studenckie Zeszyty Naukowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Observer state feedback control of discrete-time systems with state equality constraints
Autorzy:
Filasova, A.
Krokavec, D.
Powiązania:
https://bibliotekanauki.pl/articles/229818.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
equality constraints
eigenstructure assignment
state feedback
Opis:
Design conditions for existence of observer-based memory-less feedback control for stabilization of discrete-time systems with equality constraints given on the state variables are presented in the paper. These conditions are associated with eigenstructure assignment based on the singular value decomposition principle. The validity of the proposed method is demonstrated by a numerical example with the equality constraint tying together all state variables.
Źródło:
Archives of Control Sciences; 2010, 20, 3; 253-266
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Personality in project management methods
Autorzy:
Szwarc, E.
Szkatuła, K.
Bzdyra, K.
Powiązania:
https://bibliotekanauki.pl/articles/118189.pdf
Data publikacji:
2009
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
Project management
job assignment problem
personality
Opis:
High work efficiency is required by today’s organizations. Besides of other factors it depends on the right allocation of employed workers to their duties. Assigning employees to the right activities isn’t an easy task, because the job efficiency and differences in human nature have to be considered simultaneously. Usually, the decision undertaken by the human resource (HR) manager is based on his subjective experience. In several cases, such solution results in negative reactions of employees, and may lead to conflicts occurrence. In order to avoid them the problem of allocation of the properly selected team (taking into account workers’ personality) to the project’s activity is of crucial importance. Its right solution can decrease risk of activity execution delay. So, it is assumed the project’s completion time depends both on physical and psychological features of employed workers. Experimental results presented illustrate this approach.
Źródło:
Applied Computer Science; 2009, 5, 2; 68-79
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance of IP address auto-configuration protocols in Delay and Disruptive Tolerant Networks
Autorzy:
Schoeneich, R. O.
Sutkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/227276.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
address assignment
auto configuration
MANET
DTN
Opis:
At this moment there is a lack of research respecting Mobile Ad-hoc Networks (MANET) address assignment methods used in Delay Tolerant Networks (DTN). The goal of this paper is to review the SDAD, WDAD and Buddy methods of IP address assignment known from MANET in difficult environment of Delay and Disruptive Tolerant Networks. Our research allows us for estimating the effectiveness of the chosen solution and, therefore, to choose the most suitable one for specified conditions. As a part of the work we have created a tool which allows to compare these methods in terms of capability of solving address conflicts and network load. Our simulator was created from scratch in Java programming language in such a manner, that implementation of new features and improvements in the future will be as convenient as possible.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 2; 173-178
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An effective method of channels assignment for third generation cellular system
Autorzy:
Amanowicz, M.
Gajewski, P.
Krygier, J.
Powiązania:
https://bibliotekanauki.pl/articles/309331.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
WCDMA
dynamic channel assignment
3G
Opis:
An original hybrid method of channels assignment for DS-CDMA system is discussed in the paper. This method combines standard PN codes assignment policy and dynamic channel assignment procedure that minimise the cost of channel assignment. OPNET simulation model DS-CDMA system was used for assessment of the hybrid method. The results of simulation presented in the paper confirmed that the proposed method importantly improves the quality of services in the third generation cellular system.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 4; 74-78
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 141

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