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ę "search" wg kryterium: Wszystkie pola


Tytuł:
Tabu search - a guided tour
Autorzy:
Hindsberger, M.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/205563.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
combinatorial optimization
local search
metaheuristics
tabu search
Opis:
The main purpose of this paper is to provide an overview of the ideas behind Tabu Search - one of the most popular metaheuristic appoaches. For the sake of concreteness a simple example of the traveling salesman problem will be used in the discussion to illustrate the process of designing a Tabu Search algorithm. In addition, some extensions will be presented. Finally, applications will also be provided as well as references to more specialized publications.
Źródło:
Control and Cybernetics; 2000, 29, 3; 631-651
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ship Collision Avoidance by Distributed Tabu Search
Autorzy:
Kim, D.
Hirayama, K.
Okimoto, M.
Powiązania:
https://bibliotekanauki.pl/articles/116919.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Safety of Navigation
Collision Avoidance
Distributed Tabu Search Algorithm (DTSA)
Distributed Local Search Algorithm (DLSA)
Quasi-Local Minimum (QLM)
Tabu Search Algorithm
Local Search Algorithm
Distributed Tabu Search
Opis:
More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
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 Search Algorithms: An Educational View
Autorzy:
Janota, M.
Šimák, V.
Hrbček, J.
Powiązania:
https://bibliotekanauki.pl/articles/116502.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Search Algorithm
Learning Search Algorithms
educational view
Artificial Intelligence Method
Search Method
Labyrinth
Dijkstra algorithm
Opis:
Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
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ł:
Wizualność Google Search
The Visual Aspects of Google Search
Autorzy:
Kopeć, Jarosław
Powiązania:
https://bibliotekanauki.pl/articles/1029971.pdf
Data publikacji:
2013-12-15
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Opis:
The article discusses the issue of colour-related metaphors used by institutions and common users for describing the experience of using the Web. The context of thinking about modern Internet in this text is provided by William Gibson’s classic cyberpunk novel – Neuromancer. I assume that colours may be persuasive in presenting the Internet in specific, political and business-related context.
Źródło:
Człowiek i Społeczeństwo; 2013, 36, 2; 251-256
0239-3271
Pojawia się w:
Człowiek i Społeczeństwo
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reliability and uncertainty in determining search area during Search-and Rescue action
Autorzy:
Barciu, Z.
Powiązania:
https://bibliotekanauki.pl/articles/259059.pdf
Data publikacji:
2012
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
life raft
uncertainty
reliability
belief
probability
PIW (Person In Water)
search
rescue
search area
SAR
Opis:
Sea accident occurring far away from the base of rescue ships generates – for SAR action coordinator - problem of determining search areas on the basis of information which sometimes may be incomplete and uncertain, e.g. an unknown number of launched life rafts and persons in water (PIW), as well as that of sending, to the area, a non-rescue ship nearest to place of occurrence of the accident. Variety of operational states of life rafts (number of persons on raft, drift anchor etc) produces different wind leeways as a result of which search areas for the objects would be in a different distance from the last known position (LKP), e.g.: - search areas for life rafts without drift anchor, with an unknown number of castaways on board, -search areas for life rafts with drift anchor, with an unknown number of castaways on board, and - search area for the PIW. To sweep determined search areas the coordinator makes use of a ship nearest to place of danger. In this paper has been made an attempt to determine measures which would make SAR action coordinator capable of deciding which area should be searched first by using a ship nearest to place of the action.
Źródło:
Polish Maritime Research; 2012, 1; 21-30
1233-2585
Pojawia się w:
Polish Maritime Research
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ł:
Tabu search for the RNA partial degradation problem
Autorzy:
Rybarczyk, A.
Hertz, A.
Kasprzak, M.
Blazewicz, J.
Powiązania:
https://bibliotekanauki.pl/articles/330324.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
RNA degradation
tabu search
bioinformatics
rozkład RNA
algorytm tabu search
bioinformatyka
Opis:
In recent years, a growing interest has been observed in research on RNA (ribonucleic acid), primarily due to the discovery of the role of RNA molecules in biological systems. They not only serve as templates in protein synthesis or as adapters in the translation process, but also influence and are involved in the regulation of gene expression. The RNA degradation process is now heavily studied as a potential source of such riboregulators. In this paper, we consider the so-called RNA partial degradation problem (RNA PDP). By solving this combinatorial problem, one can reconstruct a given RNA molecule, having as input the results of the biochemical analysis of its degradation, which possibly contain errors (false negatives or false positives). From the computational point of view the RNA PDP is strongly NP-hard. Hence, there is a need for developing algorithms that construct good suboptimal solutions. We propose a heuristic approach, in which two tabu search algorithms cooperate, in order to reconstruct an RNA molecule. Computational tests clearly demonstrate that the proposed approach fits well the biological problem and allows to achieve near-optimal results. The algorithm is freely available at http://www.cs.put.poznan.pl/arybarczyk/tabusearch.php.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 401-415
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
PRZESZUKANIE OSOBY A KONTROLA OSOBISTA – W KONTEKŚCIE ZASADY INFORMACJI PRAWNEJ
BODY SEARCH AND PERSONAL SEARCH – IN THE CONTEXT OF THE PRINCIPLES OF LEGAL INFORMATION
Autorzy:
Kamińska-Nawrot, Aneta
Powiązania:
https://bibliotekanauki.pl/articles/508704.pdf
Data publikacji:
2017
Wydawca:
Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie
Tematy:
body search
personal search
principal of legal information
rights and obligations
administration body
Opis:
The principle of legal information imposes the obligation on the authorities authorized to search the person and on personal control to inform the participants about their rights and duties. In relation to the person searched, the provisions of the Criminal Procedure Code fully protect its implementation. On the other hand, persons subjected to personal control, which is governed by the Police Act and executive acts, are exposed to imprecise regulations that limit the sense of security of activity participants and influence on a degree of implementation of the principle of legal information and its basic functions, like guarantee and information functions.
Źródło:
Security, Economy & Law; 2017, 4/2017 (XVII)
2353-0669
Pojawia się w:
Security, Economy & Law
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards the data structure for effective word search
Autorzy:
Karwowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/95043.pdf
Data publikacji:
2018
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
text indexing
associative array
ternary search tree
Opis:
In the paper problem of searching basic forms for words in the Polish language is discussed. Polish language has a very extensive inflection and effective method for finding base form is important in many NLP tasks for example text indexing. The method for searching, based on open-source dictionary of Polish language, is presented. In this method it is important to design a structure for storing all words from dictionary, in such a way that it allows to quickly find basic words forms. Two dictionary structures: ternary search tree and associative table are presented and discussed. Tests are performed on the six actual and three crafted artificial texts and results are compared with other possible dictionary structures. At the end conclusions about structures effectiveness are formulated.
Źródło:
Information Systems in Management; 2018, 7, 4; 227-236
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Task conditions and short-term memory search: two-phase model of STM search
Autorzy:
Orzechowski, Jarosław
Nęcka, Edward
Balas, Robert
Powiązania:
https://bibliotekanauki.pl/articles/430621.pdf
Data publikacji:
2016-04-01
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
short-term memory
STM retrieval
STM search
Sternberg paradigm
familiarity
recollection
Opis:
Short-term memory (STM) search, as investigated within the Sternberg paradigm, is usually described as exhaustive rather than self-terminated, although the debate concerning these issues is still hot. We report three experiments employing a modified Sternberg paradigm and show that whether STM search is exhaustive or self-terminated depends on task conditions. Specifically, STM search self-terminates as soon as a positive match is found, whereas exhaustive search occurs when the STM content does not contain a searched item. Additionally, we show that task conditions influence whether familiarity- or recollection-based strategies dominate STM search performance. Namely, when speeding up the tempo of stimuli presentation increases the task demands, people use familiarity-based retrieval more often, which results in faster but less accurate recognition judgments. We conclude that STM search processes flexibly adapt to current task conditions and finally propose two-phase model of STM search.
Źródło:
Polish Psychological Bulletin; 2016, 47, 1; 12-20
0079-2993
Pojawia się w:
Polish Psychological Bulletin
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu search for multiobjective combinatorial optimization : TAMOCO
Autorzy:
Hansen, M.
Powiązania:
https://bibliotekanauki.pl/articles/205565.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
polioptymalizacja kombinatoryczna
metaheuristics
multiobjective combinatorial optimization (MOCO)
tabu search
Opis:
This paper presents the multiobjective tabu search method, TAMOCO. Being an adaptation of the well-known tabu search, it can be used to generate approximations to the non-dominated solutions of multiobjective combinatorial optimization problems. TAMOCO works with a set of current solutions which, through manipulation of weights, are optimized towards the non-dominated frontier while at the same time seek to disperse over the frontier. The general procedure and some extensions to it are presented, as well as suggestions of usage in interactive procedures. A computational experiment is also presented.
Źródło:
Control and Cybernetics; 2000, 29, 3; 799-818
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Skłonność do temporalnego poszukiwania korzystnych cen a wiek nabywcy
Propensity for temporal price search and consumers age
Autorzy:
Awdziej, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/592589.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
Poszukiwanie przestrzenne
Poszukiwanie temporalne
Wiek nabywcy
Consumer age
Spatial search
Temporal search
Opis:
Nabywcy mogą korzystać z obniżek cen, dostosowując swoje wizyty do kalendarza oferowanych w sklepach promocji cenowych lub odwiedzając liczne sklepy oferujące obniżki. Wyniki zaprezentowanego w artykule badania sugerują, że skłonność do poszukiwania korzystnych cenowo ofert w wymiarze temporalnym obniża się z wiekiem, a jej poziom jest związany z „biegłością rynkową” nabywcy i jego umiejętnościami szukania.
The paper presents the results of research into consumers’ propensity for temporal price search, that is delaying or accelerating purchases to benefit from price discounts. The results suggest that propensity for temporal search tends to decline with age, and is weak among elderly consumers. This might be due to the cognitive decline of more effort required to benefit from such behaviour.
Źródło:
Studia Ekonomiczne; 2017, 328; 115-125
2083-8611
Pojawia się w:
Studia Ekonomiczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Assessment of the potential effectiveness of the WIG craft in search action at sea using SARMAP software
Autorzy:
Małyszko, M.
Powiązania:
https://bibliotekanauki.pl/articles/116819.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
aviation
SARMAP
Wing in Ground (WIG)
WIG craft
search action
IAMSAR manual
International Aeronautical and Maritime Search and Rescue Manual (IAMSAR)
Search and Rescue (SAR)
Opis:
Selection and choice of search and rescue units is an important stage in planning SAR operations at sea. The different characteristics of units enable them to be used for specific tasks at sea to varying ranges. The main advantage of WIG crafts is their speed, but they also have other features necessary for marine rescue. The assessment of the unit's potential effectiveness is based, among other things, on defining and determining the parameters influencing its ability to achieve success. Computer software such as SARMAP can be used for action planning. The article contains calculations for simulated actions of searching for several objects, additionally a graphical solution of the situation has been shown.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 2; 437-442
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ł:
Derivative free optimal thrust allocation in ship dynamic positioning based on direct search algorithms
Autorzy:
Valčić, M.
Prpić-Oršić, J.
Powiązania:
https://bibliotekanauki.pl/articles/116991.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
algorithm
dynamic positioning
direct search algorithms
sequential quadratic programing (SQP)
Singular Values Decomposition (SVD)
Lagrangian Multiplier Method (LMM)
Direct Search (DS)
Mesh Adaptive Direct Search (MADS)
Opis:
In dynamic positioning systems, nonlinear cost functions, as well as nonlinear equality and inequality constraints within optimal thrust allocation procedures cannot be handled directly by means of the solvers like industry-standardized quadratic programing (QP), at least not without appropriate linearization technique applied, which can be computationally very expensive. Thus, if optimization requirements are strict, and problem should be solved for nonlinear objective function with nonlinear equality and inequality constraints, than one should use some appropriate nonlinear optimization technique. The current state-of-the-art in nonlinear optimization for gradient-based algorithms is surely the sequential quadratic programing (SQP), both for general applications and specific thrust allocation problems. On the other hand, in recent time, one can also notice the increased applications of gradient-free optimization methods in various engineering problems. In this context, the implementation of selected derivative free direct search algorithms in optimal thrust allocation is proposed and discussed in this paper, and avenues for future research are provided.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 309-314
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ł:
An analysis of discrepancies in search areas in a diagram of an expanding square search
Autorzy:
Kasyk, L.
Pleskacz, K.
Bugajski, G.
Powiązania:
https://bibliotekanauki.pl/articles/135076.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
SAR
search area
manoeuvrability characteristics
earch patterns
rescue
accident
Opis:
Search patterns and procedures contained in the International Aeronautical and Maritime Search and Rescue Manual for Mobile Facilities meet the requirements of theoretical assumptions about search and rescue operations. But the individual manoeuvrability characteristics of a search vessel cause real search and rescue operations to differ from theoretical patterns. This article analyses the difference between theoretical and actual search regions in a Diagram of an Expanding Square Search. Different variants of parameters of ship manoeuvrability have been considered. Some solutions modifying the Diagram of Expanding Square Search are proposed by the authors.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 45 (117); 94-98
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
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