Wyszukiwarka
Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 1772
-
Katalog
- Publikacje 1332 wyników po odfiltrowaniu
- Czasopisma 86 wyników po odfiltrowaniu
- Konferencje 35 wyników po odfiltrowaniu
- Osoby 62 wyników po odfiltrowaniu
- Projekty 6 wyników po odfiltrowaniu
- Kursy Online 58 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 187 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: DIGITAL SEARCH TREES
-
Approximate search strategies for weighted trees
PublikacjaW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublikacjaWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
In Search of the Innovative Digital Solutions Enhancing Social Pro-Environmental Engagement
Publikacja -
Phylogenetic trees of genus Oncidium Sw. based on analysis of DNA sequences
Dane BadawczeGenus Oncidium Sw. is widely regarded as a polyphiletic, and the taxonomic boundaries between him and such genera as Odontoglossum Kunth. or Miltonia Lindley remain blurred. The goal of the study was to determine the phylogenetic relationships within the genus Oncidium s.lato based on the DNA sequences analysis. The correlation between molecular data...
-
Adaptive Algorithm for Interactive Question-based Search
PublikacjaPopular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...
-
Construction of phylogenetic trees with topological constraints
PublikacjaThis paper proposes a method of reconstruction of phylogenetic trees based on heuristic search with topological constraints. Using topological constraints it is possible to reduce the set of solutions as well as to enforce that the result is consistent with a given hypothesis about the evolution process within some group of species. Along with this work a number of algorithms used for phylogenetic analysis were implemented. Those...
-
Jacek Stefański prof. dr hab. inż.
OsobyJacek Stefański ukończył studia na Wydziale Elektroniki Politechniki Gdańskiej (PG) w 1993 r. W 2000 r. uzyskał stopień doktora nauk technicznych w dyscyplinie telekomunikacja, w 2012 r. stopień doktora habilitowanego, natomiast w 2020 r. tytuł profesora nauk inżynieryjno-technicznych. Obecnie pracuje na stanowisku profesora w Katedrze Systemów i Sieci Radiokomunikacyjnych (KSiSR) PG. W latach 2005-2009 był zatrudniony w Instytucie...
-
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...
-
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...