Výsledky vyhledávání - "approximate algorithm"

Fast density clustering strategies based on the k-means algorithm Autor Bai, Liang, Cheng, Xueqi, Liang, Jiye, Shen, Huawei, Guo, Yike

“…•Study how to enhance the scalability of a density clustering algorithm by k-means.•Propose an accelerated algorithm of density clustering by k-means.•Propose…”
Získat plný text

A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems Autor Chen, Xin, Zhou, Yongquan, Tang, Zhonghua, Luo, Qifang

“…•The Traveling Salesman Problem (TSP) is one of the most well-known combinatorial optimization problems.•This paper we extend the two-dimensional TSP to the…”
Získat plný text

Identifying critical weak points of power-gas integrated energy system based on complex network theory Autor Zhang, Chenwei, Wang, Ying, Zheng, Tao, Wang, Chen, Zhang, Kaifeng

“…•Weighted coupling betweenness is proposed to identify critical weak points in PGIS.•An approximate algorithm of shortest-paths calculations (AA-SPC) is…”
Získat plný text

Bunkering policies for a fuel bunker management problem for liner shipping networks Autor De, Arijit, Choudhary, Alok, Turkay, Metin, Tiwari, Manoj K.

“…•We investigate a dynamic bunker fuel management problem for liner shipping.•We consider fuel bunkering policies with the dynamic fuel price scenarios and fuel…”
Získat plný text

Minimizing the misinformation concern over social networks Autor Ni, Peikun, Zhu, Jianming, Gao, Yuxin, Wang, Guoqing

Získat plný text

Deterministic Approximate Methods for Maximum Consensus Robust Fitting Autor 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…”
Získat plný text

The role of influential nodes and their influence domain in community detection: An approximate method for maximizing modularity Autor Javadpour Boroujeni, Rouhollah, Soleimani, Seyfollah

“…•Modularity maximization is one of the newest methods for community detection.•Using approximate algorithms based on identifying influential nodes for…”
Získat plný text

An on-the-fly framework for usable access control policy mining Autor Guo, Yunchuan, Wang, Xiao, Yu, Mingjie, Li, Fenghua, Pang, Zhen, Fang, Liang

“…Access control policy mining, which extracts or infers access control policies from existing system logs or configurations within a given environment, is…”
Získat plný text

An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints Autor Kurita, Kazuhiro, Wasa, Kunihiro

“…K-best enumeration, which asks to output k-best solutions without duplication, is a helpful tool in data analysis for many fields. In such fields, graphs…”
Získat plný text

A provably efficient in-network computing services deployment approach for security burst Autor Zheng, Danyang, Wang, Chao, Xu, Honghui, Tang, Wenyi, Zhong, Yihan, Cao, Xiaojun

“…•Towards the periodic need for enhancing and migrating security service to defend against ever-changing cyber-attacks within the in-network computing (INC)…”
Získat plný text

Just-in-time two-dimensional bin packing Autor Polyakovskiy, Sergey, M’Hallah, Rym

“…•We combine bin packing and just-in-time batch scheduling into a new problem.•We minimize total weighted earliness tardiness in a combined packing scheduling…”
Získat plný text

Towards cost optimization in security-aware service function chaining and embedding over multi-vendor edge networks Autor Wang, Chao, Zheng, Danyang, Liu, Xiaorong, Tang, Wenyi, Xu, Honghui, Cao, Xiaojun

“…Frequent cyber-attacks compel service providers to employ security-aware service functions (S-SFs) while delivering network services. Typically, one S-SF can…”
Získat plný text

A cost-provable solution for reliable in-network computing-enabled services deployment Autor Liu, Xiaorong, Zheng, Danyang, Xing, Huanlai, Feng, Li, Peng, Chengzong, Cao, Xiaojun

“…Recently, the in-network computing (INC) technique has been widely adopted by various applications including the reliability-sensitive ones such as remote…”
Získat plný text

Provably efficient security-aware service function tree composing and embedding in multi-vendor networks Autor Zheng, Danyang, Xing, Huanlai, Feng, Li, Cao, Xiaojun

“…Multicast greatly benefits many emerging applications such as federated learning, metaverse, and data warehouse. Recently, due to frequent cyber-attacks,…”
Získat plný text

Mhorseshoe package in R: Approximate algorithm for the horseshoe prior in Bayesian linear model Autor Kang, Mingi, Lee, Kyoungjae

“…The horseshoe prior is a continuous shrinkage prior frequently used in high-dimensional Bayesian sparse linear regression models. Although the horseshoe prior…”
Získat plný text

Event-Participant and Incremental Planning over Event-Based Social Networks Autor Cheng, Yurong, Yuan, Ye, Chen, Lei, Giraud-Carrier, Christophe, Wang, Guoren, Li, Boyang

“…In recent years, online Event Based Social Network (EBSN) platforms have become increasingly popular. One typical task of EBSN platforms is to help users make…”
Získat plný text

Exact and approximate algorithms for discounted {0-1} knapsack problem Autor He, Yi-Chao, Wang, Xi-Zhao, He, Yu-Lin, Zhao, Shu-Liang, Li, Wen-Bin

“…The Discounted {0-1} Knapsack Problem (D{0-1}KP) is an extension of the classical 0-1 knapsack problem (0-1 KP) that consists of selecting a set of item groups…”
Získat plný text

Heuristic and approximate Steiner tree algorithms for ensuring network connectivity in mobile wireless sensor networks Autor Son, Nguyen Van, Hanh, Nguyen Thi, Minh, Trinh The, Binh, Huynh Thi Thanh, Thang, Nguyen Xuan

“…Connectivity problems are among the most challenging issues in Mobile Wireless Sensor Networks (MWSNs). Ensuring connectivity in such networks means finding…”
Získat plný text

Multi-Batches Revenue Maximization for competitive products over online social network Autor Liang, Guangxian, Yao, Xiaopeng, Gu, Yue, Huang, Hejiao, Gu, Chonglin

“…Enterprises can promote their products widely and rapidly over Online Social Network (OSN) through viral marketing. Viral marketing means an enterprise gives…”
Získat plný text

Algorithms for Cameras View-Frame Placement Problems in the Presence of an Adversary and Distributional Ambiguity Autor Park, Seonghun, Bansal, Manish

“…In this paper, we introduce cameras view-frame placement problem (denoted by CFP) in the presence of an adversary whose objective is to minimize the maximum…”
Získat plný text