Search Results - "deterministic algorithm"

Collision-free exploration by mobile agents using pebbles by Das, Sajal K., Dhar, Amit Kumar, Gorain, Barun, Mahawar, Madhuri

“…In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G=(V,E) where the nodes of the graph are…”
Get full text

Efficient deterministic algorithms for maximizing symmetric submodular functions by Wan, Zongqi, Zhang, Jialin, Sun, Xiaoming, Zhang, Zhijie

“…Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The…”
Get full text

Path connected dynamic graphs with a study of dispersion and exploration by Saxena, Ashish, Mondal, Kaushik

“…In dynamic graphs, several edges may get added or deleted in a round. There are different connectivity models based on the constraints on the addition/deletion…”
Get full text

Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid by Gao, Younan, Pelc, Andrzej

“…Two identical anonymous mobile agents have to meet at a node of the infinite oriented grid whose nodes are unlabeled. This problem is known as rendezvous. The…”
Get full text

A penalty-free hybrid algorithm framework based on feasible stream matching principle for large-scale heat exchanger networks synthesis by Yang, Lu, Ren, Jingzheng, Eden, Mario, Chang, Chenglin, Shen, Weifeng

“…•A penalty-free hybrid stochastic-deterministic algorithm framework is proposed for large-scale HENS.•The proposed framework significantly reduces the…”
Get full text

A further study on weak Byzantine gathering of mobile agents by Saxena, Ashish, Mondal, Kaushik

“…The gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al. Authors provide a polynomial time algorithm handling…”
Get full text

An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint by Gong, Shufang, Liu, Bin, Fang, Qizhi

“…Submodular optimization not only covers some classical combinatorial optimization problems, but also has a wide range of applications in fields such as machine…”
Get full text

Deterministic Approximate Methods for Maximum Consensus Robust Fitting by Le, Huu, Chin, Tat-Jun, Eriksson, Anders, Do, Thanh-Toan, Suter, David

“…Maximum consensus estimation plays a critically important role in several robust fitting problems in computer vision. Currently, the most prevalent algorithms…”
Get full text

Collaborative dispersion by silent robots by Gorain, Barun, Mandal, Partha Sarathi, Mondal, Kaushik, Pandit, Supantha

“…In the dispersion problem, a set of k co-located mobile robots must relocate themselves in distinct nodes of an unknown network. The network is modeled as an…”
Get full text

Global optimization for large‐scale water network synthesis based on dynamic partition and adaptive bound tightening by Zhou, Wenjin, Liu, Linlin, Du, Jian

“…The synthesis of large‐scale integrated water networks is typically formulated as nonconvex mixed‐integer quadratic constrained programming (MIQCP) or QCP…”
Get full text

Placement optimization of multiple UAVs for energy-efficient maximal user coverage by Zhang, Chen, Gui, Xiang, Gupta, Gourab Sen, Hasan, Syed Faraz

“…This paper proposes a deterministic Global Optimization Algorithm (GOA) for UAV-assisted communications, developed as an enhancement to the benchmark Two-Stage…”
Get full text

Thermal analysis of tubular arrangements submitted to external flow using constructal theory by Pedroti, V.A., de Escobar, C.C., dos Santos, E.D., Souza, J.A.

“…Present work performs a numerical study about the energy removal in a heated tubular array submitted to an external flow. Taking into account that a large…”
Get full text

Implementation of the operational guidance as a part of the second generation intact stability criteria to the deterministic ship weather routing by Zyczkowski, Marcin, Krata, Przemyslaw, Szozda, Zbigniew

“…The paper presents an innovative approach to ship route planning, with a Decision Support System (DSS) at its core. DSS integrates deterministic algorithms…”
Get full text

Deterministic non-adaptive contention resolution on a shared channel by De Marco, Gianluca, Kowalski, Dariusz R., Stachowiak, Grzegorz

“…In a multiple access channel, autonomous stations are able to transmit and listen to a shared device. A fundamental problem, called contention resolution, is…”
Get full text

Optimal algorithm of the traveling salesman problem for tourist location selection by Hossen, Md. Riad, Koushik, Hami Jafar, Uddin, Mohammed Forhad, Rahman, Md. Atiqur, Hye, Md. Abdul

“…This study explores the Traveling Salesman Problem (TSP) by applying both deterministic and stochastic algorithms. The deterministic algorithms include the…”
Get full text

A deterministic gradient-based approach to avoid saddle points by Kreusser, L. M., Osher, S. J., Wang, B.

“…Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning (ML) models efficiently. First-order…”
Get full text

Algorithmic research on surface roughness in laser-melted claddings: A review by Zhao, Changlong, Zhang, Zihao, Yu, Zice, Du, Weilong

“…As a breakthrough of the additive manufacturing technology being achieved, many fields have broadly applied laser cladding due to its unique advantages. But…”
Get full text

Lightning: A High-Efficient Neighbor Discovery Protocol for Low Duty Cycle WSNs by Wei, Liangxiong, Zhou, Beisi, Ma, Xichu, Chen, Dexin, Zhang, Jingyu, Peng, Jian, Luo, Qian, Sun, Limin, Li, Dingcheng, Chen, Liangyin

“…In wireless sensor networks (WSNs), due to the limited energy of nodes, discovering neighbors needs to be achieved in an energy-efficient way. This means that,…”
Get full text

Deterministic algorithms for the hidden subgroup problem by Ye, Zekun, Li, Lvzhou

“…The hidden subgroup problem (HSP) plays a crucial role in the field of quantum computing, since several celebrated quantum algorithms including Shor's…”
Get full text

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line by Kuo, Tung-Wei

“…We study the online minimum cost bipartite perfect matching with delays problem. In this problem, servers and requests arrive over time, and an online…”
Get full text