Wyszukiwarka
Wyniki wyszukiwania dla: searching
-
Searching by Heterogeneous Agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Searching the growth factors.
PublikacjaW części literaturowej przedstawiono dotychczasową wiedzę na temat dotych-czasowych czynników wzrostu małych przedsiębiorstw, tworząc model badawczy. W części literaturowej opisano wyniki badań przeprowadzonych na próbie 28 właścicieli małych firm w regionie Gdańskim w latach 1996 i 2003.
-
Searching by heterogeneous agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Connected searching of weighted trees
PublikacjaW artykule rozważamy problem spójnego przeszukiwania drzew obciążonych. Autorzy w [L. Barriere i inni, Capture of an intruder by mobile agents, SPAA'02 (2002) 200-209] twierdzą, że istnieje wielomianowy algorytm dla problemu obliczania optymalnej strategii przeszukiwania obciążonego drzewa. W niniejszej pracy pokazano, że problem ten jest obliczeniowo trudny nawet dla wierzchołkowo-obciążonych drzew (wagi krawędzi równe 1) oraz...
-
Connected searching of weighted trees
PublikacjaW pracy pokazano, że problem spójnego przeszukiwania drzew ważonych jest silnie NP-zupełny. Problem pozostaje trudnym dla drzew z jednym wierzchołkiem o stopniu większym niż 2. Ponadto, przedstawiony został wielomianowy optymalny algorytm dla klasy drzew z ograniczonym stopniem.
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Distributed graph searching with a sense of direction
PublikacjaIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Non-monotone graph searching models
PublikacjaGraph searching encompasses a variety of different models, many of which share a property that in optimal strategies fugitive can never access once searched regions. Monotonicity, as it is called, is vital in many established results in the field however its absence significantly impedes the analysis of a given problem. This survey attempts to gather non-monotone models, that are less researched in effort of summarizing the results...
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Edge ranking and searching in partial orders
PublikacjaArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
Searching for metric structure of musical files
PublikacjaCelem opisywanych prac jest porównanie efektywności wybranych metod sztucznej inteligencji w wyznaczaniu rytmu dla zapisu symbolicznego muzyki. Opisano sposób wykorzystania sztucznych sieci neuronowych i zbiorów przybliżonych do poszukiwania właściwej struktury rytmicznej utworu. Analizowane są fizyczne atrybuty dźwięku, które są najbardziej znaczące dla określenia położenia dźwięku na pozycji akcentowanej lub nieakcentowanej....
-
Searching for new development in areas of the city
Publikacja -
Hearing and stomatognathic system: Searching for a link
Publikacja -
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Searching for innovation knowledge: insight into KIBS companies
PublikacjaPurpose – The paper analyzes the patterns of research of “innovation knowledge” (i.e. knowledge that can result in introducing innovations in the company that can be observed in KIBS (Knowledge-Intensive Business Services) companies. Particularly, it identifies and classifies the possible approaches adopted by companies on the basis of two dimensions: the intensity/proactivity of search efforts, and the source primarily used. Design/methodology/approach...
-
Searching for smart solutions:Comparative study of Gdansk and Glasgow
PublikacjaThis chapter is the executive summary of undertaken comparative study between Gdansk and Glasgow.
-
Searching for innovation knowledge: insight into KIBS companies
PublikacjaThe paper analyses the activity of research for “innovation knowledge”—here defined as knowledge that can lead to the introduction of service innovations—by Knowledge-Intensive Business Services (KIBS) companies. It proposes a classification of the possible search approaches adopted by those companies based on two dimensions: the pro-activity of search efforts and the source primarily used. Such classification is then discussed...
-
Blackout initial disturbances in electric Power System searching
PublikacjaThe paper contains short survey of the blackouts that took place in the last few years. The sources and initial disturbances are discussed. The typical scenario of the disturbance, leading to blackout in the electrical power system are presented.Next, models of a power system eligible to considered topic are discussed. Finally the algorithm of the blackout initial disturbances in power system searching is presented.The consideration...
-
Landscape of the Vistula Estuary - searching for traces of ingenium embodied
PublikacjaArtykuł podaje skrótowe informacje o dawnym i współczesnym znaczeniu obiektów inżynieryjnych w krajobrazie delty Wisły, które znalazły się na trasie objazdu konserwatorskiego w dniu 5 maja w ramach realizacji programu konferencji HOT-GO 4 wraz z kalendarium ich dziejów: Most Lisewski przez Wisłę w Tczewie, wielki przekop Wisły w Świbnie, śluzy w Przegalinie, Gdańskiej Głowie i Białej Górze, relikty kanału w Piekle.