Výsledky vyhľadávania - "Search tree algorithms"

An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems

Autori: Gonçalves de Oliveira Passos, Fernanda Rebello, Vinod E. F. RCIPL

Prispievatelia: Gonçalves de Oliveira Passos, Fernanda Rebello, Vinod E. F. RCIPL

Predmety: Autonomic computing, Heterogeneous distributed systems, Parallel branch-and-prune algorithms, Search tree algorithms, Self-configuring parallel algorithms

Popis súboru: application/pdf

Relation: 1532-0626

Dostupnosť: http://hdl.handle.net/10400.21/21984

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions

Autori: Bulteau, Laurent Jones, Mark Niedermeier, Rolf a ďalší

Prispievatelia: Bulteau, Laurent Jones, Mark Niedermeier, Rolf a ďalší

Predmety: NP-hard string problems, multiple sequence alignment, center string, parameterized complexity, search tree algorithms, enumerative algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 223, 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.6

Dostupnosť: https://doi.org/10.4230/LIPIcs.CPM.2022.6
https://nbn-resolving.org/urn:nbn:de:0030-drops-161338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.6

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Number of Deletions

Autori: Bulteau, Laurent Jones, Mark Niedermeier, Rolf a ďalší

Prispievatelia: Bulteau, Laurent Jones, Mark Niedermeier, Rolf a ďalší

Zdroj: https://hal.science/hal-03322887 ; 2021.

Predmety: NP-hard string problems, multiple sequence alignment, parameterized complexity, search tree algorithms, enumerative algorithms, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Dostupnosť: https://hal.science/hal-03322887
https://hal.science/hal-03322887v1/document
https://hal.science/hal-03322887v1/file/LCS___HAL.pdf

Parameterized Algorithms for Hitting Set: The Weighted Case

Autori: Henning Fernau

Zdroj: Lecture Notes in Computer Science ISBN: 9783540343752

Predmety: Parameterized algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Hitting set problems, 01 natural sciences, Search tree algorithms

Prístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/S0304397510000046
https://www.sciencedirect.com/science/article/pii/S0304397510000046
https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#Fernau10
https://www.uni-trier.de/fileadmin/fb4/INF/TechReports/whsjournal.pdf
https://rd.springer.com/chapter/10.1007/11758471_32
https://link.springer.com/chapter/10.1007/11758471_32
https://dblp.uni-trier.de/db/conf/ciac/ciac2006.html#Fernau06

Parameterized algorithmics for d-Hitting Set

Autori: Fernau, Henning The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science

Prispievatelia: Fernau, Henning The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science

Zdroj: International Journal of Computer Mathematics. 87:3157-3174

Predmety: analysis of search tree algorithms, parameterized algorithms, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, d-HITTING SET, 0102 computer and information sciences, 02 engineering and technology, HITTING SET problems, 01 natural sciences

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ijcm/ijcm87.html#Fernau10
https://www.tandfonline.com/doi/full/10.1080/00207160903176868
https://core.ac.uk/display/13663812

On the Subtree Size Profile of Binary Search trees

Autori: Rudolf Grübel Florian Dennert

Zdroj: Combinatorics, Probability and Computing. 19:561-578

Predmety: Asymptotic behaviour, Subtrees, Asymptotic analysis, Binary search trees, Random tree, Process view, K-values, 0102 computer and information sciences, Binary trees, Qualitative differences, Trees (mathematics), 01 natural sciences, Dewey Decimal Classification::500 | Naturwissenschaften::510 | Mathematik, Joint distributions, Binary search tree algorithms, Upper-end, 0101 mathematics

Prístupová URL adresa: https://www.repo.uni-hannover.de/bitstream/123456789/2721/1/on_the_subtree_size_profile_of_binary_search_trees.pdf
https://www.stochastik.uni-hannover.de/fileadmin/institut/pdf/DennertGruebel2009rev.pdf
https://www.repo.uni-hannover.de/handle/123456789/2721
https://dblp.uni-trier.de/db/journals/cpc/cpc19.html#DennertG10
https://dl.acm.org/doi/10.1017/S0963548309990630
https://www.repo.uni-hannover.de/bitstream/123456789/2721/1/on_the_subtree_size_profile_of_binary_search_trees.pdf

The cost of offline binary search tree algorithms and the complexity of the request sequence

Autori: Tapio Elomaa Jussi Kujala

Zdroj: Theoretical Computer Science. 393:231-239

Predmety: Splay trees, Offline binary search tree algorithms, Kolmogorov complexity, 0102 computer and information sciences, 06 humanities and the arts, 0603 philosophy, ethics and religion, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: https://core.ac.uk/display/20796430
https://www.sciencedirect.com/science/article/pii/S0304397507008833
https://dblp.uni-trier.de/db/journals/tcs/tcs393.html#KujalaE08
https://dl.acm.org/doi/10.1016/j.tcs.2007.12.015

On the subtree size profile of binary search trees

Autori: Dennert, Florian Grübel, Rudolf

Zdroj: Combinatorics, Probability and Computing 19 (2010), Nr. 4

Predmety: Asymptotic behaviour, Binary search tree algorithms, Binary search trees, Joint distributions, K-values, Process view, Qualitative differences, Random tree, Subtrees, Upper-end, Asymptotic analysis, Binary trees, Trees (mathematics), ddc:510

Relation: http://dx.doi.org/10.15488/2695

Dostupnosť: http://www.repo.uni-hannover.de/handle/123456789/2721
https://doi.org/10.15488/2695

The Cost of Offline Binary Search Tree Algorithms and the Complexity of the Request Sequence

Autori: Jussi Kujala Tapio Elomaa The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Jussi Kujala Tapio Elomaa The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.tut.fi/~kujala2/papers/tcs_article.pdf.

Predmety: Offline binary search tree algorithms, Kolmogorov complexity, Splay trees

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1229; http://www.cs.tut.fi/~kujala2/papers/tcs_article.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1229
http://www.cs.tut.fi/~kujala2/papers/tcs_article.pdf

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions

Autori: Bulteau, Laurent (author) Jones, M.E.L. (author) Niedermeier, Rolf (author) a ďalší

Témy: center string, enumerative algorithms, multiple sequence alignment, NP-hard string problems, parameterized complexity, search tree algorithms, conference paper

URL: http://resolver.tudelft.nl/uuid:d08de189-661c-44b6-a3da-54b2585eb00f
http://www.scopus.com/inward/record.url?scp=85134309993&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85134309993&partnerID=8YFLogxK
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022--9783959772341
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022--563370b5-196a-4e92-8fb6-5be8340b96b6