Výsledky vyhledávání - "Search tree algorithms"

An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems Autor Passos, Fernanda G. O., Rebello, Vinod E. F.

“…Summary Backtracking branch‐and‐prune (BP) algorithms and their variants are exhaustive search tree techniques widely employed to solve optimization problems…”
Získat plný text

Parameterized algorithms for d - Hitting Set: The weighted case Autor Fernau, Henning

“…We are going to analyze search tree algorithms for Weighted d - Hitting Set. Although the algorithms that we develop are fairly simple, their analysis is…”
Získat plný text

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems Autor Gramm, Jens, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf

Získat plný text

Parameterized algorithmics for d-Hitting Set Autor Fernau, Henning

“…Based on the methodology we presented in earlier work on parameterized algorithms for 3-Hitting Set, we develop simple search tree-based algorithms for…”
Získat plný text

The cost of offline binary search tree algorithms and the complexity of the request sequence Autor Kujala, Jussi, Elomaa, Tapio

“…In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower…”
Získat plný text

A golden ratio parameterized algorithm for Cluster Editing Autor Böcker, Sebastian

“…The Cluster Editing problem asks to transform a graph by at most k edge modifications into a disjoint union of cliques. The problem is NP-complete, but several…”
Získat plný text

Survey and Analysis of Citizen Network Political Participation Based on Binary Search Tree Algorithm Autor Li, Haixia

“…NTRODUCTION: In the digital age, citizens' online political engagement is crucial for the development and stability of society.OBJECTIVES: To gain insights…”
Získat plný text

A Physical Layer Network Coding Based Tag Anti-collision Algorithm for RFID System Autor Wang, Cuixiang, Shao, Xing, Meng, Yifan, Gao, Jun

Získat plný text

On the parameterized complexity of consensus clustering Autor Dörnfelder, Martin, Guo, Jiong, Komusiewicz, Christian, Weller, Mathias

“…Given a collection C of partitions of a base set S, the NP-hard Consensus Clustering problem asks for a partition of S which has a total Mirkin distance of at…”
Získat plný text

Research on the Path Planning Algorithm of Mobile Robot Autor Gao, Yingding, Hu, Tianyang, Wang, Yinchu, Zhang, Yang

“…Aiming at the problem of local deadlock and path redundancy when mobile robots are running in a complex and unknown environment, specific application design…”
Získat plný text

Smart Substation VLAN Configuration Method Based on Improved Search Tree Autor Zhang, Hongtao, Liu, Yuntao, Zou, Gang, Jiang, Zikai, Huang, Wei, Zhou, Kunjun

“…A smart substation VLAN configuration method based on improved search tree is proposed to address the problem of network uncertainty caused by the lack of…”
Získat plný text

High-Speed Retrieval Method for Unstructured Big Data Platform Based on K-Ary Search Tree Algorithm Autor Helin, Zhang, Meiling, Jiang, Yiting, Wang, Hang, Zhang, Huadong, Liao, Anqing, Chen

“…With the popularity of the Internet, the amount of data created by people every day increases exponentially, and most of these data are unstructured data. How…”
Získat plný text