Results 21 to 30 of about 62,130 (264)
Distributed Multi-Agent Hierarchy Construction for Dynamic DCOPs in Mobile Sensor Teams
Human-Centric Intelligent Systems, 2023 Coordinating multiple agents to optimize an objective has several real-world applications. In areas such as disaster rescue, environment monitoring and the like, mobile agents may be deployed to work as a team to achieve a joint goal.
Brighter Agyemang, Fenghui Ren, Jun Yan
doaj +1 more source
Dynamic algorithms for graphs with treewidth 2 [PDF]
, 1994 In this paper, we consider algorithms for maintaining treedecompositions with constant bounded treewidth under edge and vertex insertions and deletions for graphs with treewidth at most 2 (also called: partial 2-trees, or series-parallel graphs), and for almost trees with parameter k. Each operation can be performed in O(log n) time. For a large number
openaire +3 more sources
Applied Network Science, 2023 Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications.
Naw Safrin Sattar +3 more
doaj +1 more source
Algorithms and Hardness for Diameter in Dynamic Graphs
CoRR, 2018 The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive.
Bertie Ancona +4 more
openaire +5 more sources
Spatio-Temporal Graph Convolution Transformer for Video Question Answering
IEEE AccessCurrently, video question answering (VideoQA) algorithms relying on video-text pretraining models employ intricate unimodal encoders and multimodal fusion Transformers, which often lead to decreased efficiency in tasks such as visual reasoning ...
Jiahao Tang +6 more
doaj +1 more source
Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
Journal of King Saud University: Computer and Information Sciences, 2021 Dynamic shortest path algorithms are the ones which are used to accommodate the online sequence of update operations to the underlying graph topology and also facilitate the subsequent query operations.
Sunita, Deepak Garg
doaj +1 more source
A Simple Greedy Algorithm for Dynamic Graph Orientation [PDF]
Algorithmica, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edvin Berglin, Gerth Stølting Brodal
openaire +5 more sources
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Experimental Analysis of Algorithms for the Dynamic Graph Coloring Problem
Journal of Graph Algorithms and ApplicationsThis paper focuses on the dynamic graph coloring problem, a dynamic variant based on the well-researched graph coloring problem. This variant of the problem not only considers the number of colors used in the coloring for a graph, but also how many ...
Menno Theunis, Marcel Roeloffzen
doaj +1 more source
Modeling the Connections of Dynamic Sensor Fields Based on BT-Graph
EAI Endorsed Transactions on Context-aware Systems and Applications, 2016 In this article, we propose a new approach to model and optimize the dynamic sensor field for both internal network connections and LEO satellite connection based on BT Graph. Due to the shift of LEO satellite’s orbit at each revolution, a dynamic sensor
Tuyen Phong Truong +4 more
doaj +1 more source