Výsledky vyhledávání - Search tree algorithm

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

Autoři: Gonçalves de Oliveira Passos, Fernanda Rebello, Vinod E. F. RCIPL

Přispěvatelé: Gonçalves de Oliveira Passos, Fernanda Rebello, Vinod E. F. RCIPL

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

Popis souboru: application/pdf

Relation: 1532-0626

Dostupnost: http://hdl.handle.net/10400.21/21984

Using Unmanned Aerial Vehicle Inspection Digital Orthophotos and Search Tree Algorithm to Improve the Accuracy of Power Line Defect Recognition

Autoři: Lei Wei Junchen Guo

Zdroj: RE&PQJ. 23:116-129

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length

Autoři: Huber, Michael Kiran

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 05C85, 68Q25, Data Structures and Algorithms (cs.DS), G.2.2, F.2.2

Přístupová URL adresa: http://arxiv.org/abs/2404.10469

Intelligent sequential multi-impulse collision avoidance method for non-cooperative spacecraft based on an improved search tree algorithm

Autoři: Xuyang CAO Xin NING Zheng WANG a další

Zdroj: Chinese Journal of Aeronautics. 38:103205

The Application of RRT Fast Search Tree Algorithm in Route Planning and Obstacle Avoidance of Unmanned Vehicle

Autoři: Jianhui Cui Yuanyuan Wu Yongjian Zhai a další

Zdroj: Lecture Notes on Data Engineering and Communications Technologies ISBN: 9789819719822

High-Speed Retrieval Method for Unstructured Big Data Platform Based on K-Ary Search Tree Algorithm

Autoři: Zhang Helin Jiang Meiling Wang Yiting a další

Zdroj: 2022 IEEE Conference on Telecommunications, Optics and Computer Science (TOCS). :598-601

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Survey and Analysis of Citizen Network Political Participation Based on Binary Search Tree Algorithm

Autoři: Haixia Li

Zdroj: ICST Transactions on Scalable Information Systems. 11

Témata: 16. Peace & justice

Competitive Online Search Trees on Trees

Autoři: Prosenjit Bose Jean Cardinal John Iacono a další

Zdroj: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ISBN: 9781611975994
arXiv.org
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, Philadelphia

Témata: FOS: Computer and information sciences, Théorie de l'information, online algorithms, Informatique générale, dynamic optimality, tango trees, 0102 computer and information sciences, 01 natural sciences, Théorie des algorithmes, search trees, Informatique mathématique, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Search trees on trees

Popis souboru: 1 full-text file(s): application/pdf

Přístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.115
http://arxiv.org/abs/1908.00848
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/317587/Details
https://arxiv.org/abs/1908.00848
https://arxiv.org/pdf/1908.00848.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-00848
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326150
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/317587

Competitive Online Search Trees on Trees.

Autoři: BOSE, PROSENJIT CARDINAL, JEAN IACONO, JOHN a další

Zdroj: ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-19, 19p

Témata: ELECTRONIC information resource searching, SMART structures, SEARCH algorithms, DATA structures, AIRBORNE lasers, APPROXIMATION algorithms

A search for wandering black holes in the Milky Way

Autoři: Untzaga San Vicente, Julen

Thesis Advisors: Mezcua Pallerola, Mar, Bonoli , Silvia, Font Guiteras, Lluís

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Forats negres, Black hole, Agujeros negros, Via Làctia, Milky Way, Vía Láctea, Ciències Experimentals

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/695948

Research on Hybrid Encryption of Cross Border E-commerce Transaction Information Based on B+ Search Tree Algorithm

Autoři: Jia-hua Li

Zdroj: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ISBN: 9783030941840

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

Autoři: Tapio Elomaa Jussi Kujala

Zdroj: Theoretical Computer Science. 393:231-239

Témata: 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)

Pří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

Linearizability Analysis of the Contention-Friendly Binary Search Tree

Autoři: Abraham, Uri Hayoun, Avi

Témata: FOS: Computer and information sciences, Computer Science - Programming Languages, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), Programming Languages (cs.PL)

Přístupová URL adresa: http://arxiv.org/abs/2305.07758

ON THE SILHOUETTE OF BINARY SEARCH TREES

Autoři: Grübel, Rudolf

Zdroj: The Annals of Applied Probability, 2009 Oct 01. 19(5), 1781-1802.

Přístupová URL adresa: https://www.jstor.org/stable/25662522

Avoiding markers for longest prefix match based on binary search tree algorithm

An Almost Sure Result for Path Lengths in Binary Search Trees

Autoři: Dekking, F. M. Meester, L. E.

Zdroj: Advances in Applied Probability, 2003 Jun 01. 35(2), 363-376.

Přístupová URL adresa: https://www.jstor.org/stable/1428427

Mixed Poisson Approximation of Node Depth Distributions in Random Binary Search Trees

Autoři: Grübel, Rudolf Stefanoski, Nikolče

Zdroj: The Annals of Applied Probability, 2005 Feb 01. 15(1A), 279-297.

Přístupová URL adresa: https://www.jstor.org/stable/30038316

Distribution of Distances in Random Binary Search Trees

Autoři: Mahmoud, Hosam M. Neininger, Ralph

Zdroj: The Annals of Applied Probability, 2003 Feb 01. 13(1), 253-276.

Přístupová URL adresa: https://www.jstor.org/stable/1193143

Performance Comparison of Binary Search Tree and Framed ALOHA Algorithms for RFID Anti-Collision

Autoři: Wen-Tzu Chen

Zdroj: IEICE Transactions on Communications. :1168-1171

Témata: 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://researchoutput.ncku.edu.tw/zh/publications/performance-comparison-of-binary-search-tree-and-framed-aloha-alg
https://dblp.uni-trier.de/db/journals/ieicet/ieicet91b.html#Chen08a
http://ui.adsabs.harvard.edu/abs/2010IEITC..91.1168C/abstract
https://ci.nii.ac.jp/naid/10026828596
https://dialnet.unirioja.es/servlet/articulo?codigo=3500998
http://ir.lib.ncku.edu.tw/handle/987654321/87435

A bounded search tree algorithm for parameterized face cover

Autoři: Henning Fernau Michael A. Langston Faisal N. Abu-Khzam

Zdroj: Journal of Discrete Algorithms. 6:541-552

Témata: Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S1570866708000464
https://doi.org/10.1016/j.jda.2008.07.004
https://www.sciencedirect.com/science/article/abs/pii/S1570866708000464
https://dblp.uni-trier.de/db/journals/jda/jda6.html#Abu-KhzamFL08
https://laur.lau.edu.lb:8443/xmlui/handle/10725/2775