Výsledky vyhľadávania - greedy heuristic approximation algorithm

Multi-sphere approximation of real particles for DEM simulation based on a modified greedy heuristic algorithm Autor Li, Cheng-Qing, Xu, Wen-Jie, Meng, Qing-Shan

“… Then, we use an algorithm to solve the set-covering problem in detail. This manuscript presents three different solution schemes based on a modified greedy heuristic…”
Získať plný text

Time-Domain Greedy Heuristic Approximation Algorithm for Multi-channel Assignment in Wireless Mesh Network Autor Wei-wei, Zhang, Jia-feng, He, Guo-wang, Gao, Li-li, Ren, ShenXuan-jing

“… This paper proposed a multi-channel allocation algorithm based on Time-Domain Greedy heuristic approximation algorithm…”
Získať plný text

Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks Autor Qun Zhao, Gurusamy, M.

“… We determine an upper bound on the network lifetime for the MCT problem and then develop a (1+ w ) H (M circ) approximation algorithm to solve it, where w is an arbitrarily small number, H…”
Získať plný text

Submodularity and local search approaches for maximum capture problems under generalized extreme value models Autor Dam, Tien Thanh, Ta, Thuy Anh, Mai, Tien

“…•A new local search algorithm with a performance guarantee.•Experiments with instances from the logit, mixed logit and nested logit models…”
Získať plný text

SLADE: A Smart Large-Scale Task Decomposer in Crowdsourcing Autor Tong, Yongxin, Chen, Lei, Zhou, Zimu, Jagadish, H. V., Shou, Lidan, Lv, Weifeng

“…Crowdsourcing has been shown to be effective in a wide range of applications, and is seeing increasing use. A large-scale crowdsourcing task often consists of…”
Získať plný text

Approximation algorithms for Steiner forest: An experimental study Autor Ghalami, Laleh, Grosu, Daniel

“… Motivated by the recent work on greedy approximation algorithms for the Steiner forest, we provide efficient implementations of existing approximation algorithms and conduct a thorough experimental…”
Získať plný text

Mobility-Aware Proactive Flow Setup in Software-Defined Mobile Edge Networks Autor Zeng, Yue, Ye, Baoliu, Tang, Bin, Lu, Sanglu, Xu, Feng, Guo, Song, Qu, Zhihao

“…The software-defined network (SDN) enabled mobile edge network greatly facilitates network resource management and promotes many emerging applications…”
Získať plný text

A comparison of utility-oriented algorithms for scheduling parallel tasks in multi-cluster grid Autor Zhang, Jinghui, Luo, Junzhou

“… On the basis of the model we present an approximation algorithm, a repair strategy based genetic algorithm and greedy heuristics MaxMax, T-Sufferage and R-Sufferage to solve the two interdependent problems…”
Získať plný text

GRASP and ILS Based Meta-Heuristic Approximation Algorithms for Optimal Virtual Network Synthesis (VNS) in Multi-AS Environment Autor Xue, Yong, Brodsky, Alexander, Menasce, Daniel

“…Emerging Internet architecture utilizes a pluralistic architectural paradigm in which multiple virtual overlay service networks are built on top of the…”
Získať plný text

Heuristic approaches for the flow-based set covering problem with deviation paths Autor Li, Shengyin, Huang, Yongxi

“… This study is focused on developing heuristic approximation solutions, specifically the greedy-adding and greedy-adding with extension algorithms…”
Získať plný text

Parallel Algorithms for Unsupervised Tagging Autor Ravi, Sujith, Vassilivitskii, Sergei, Rastogi, Vibhor

“… In contrast to previous approaches that rely on manually specified and multi-step heuristics for model minimization, our approach is a simple greedy approximation algorithm DMLC (D -M -L -C…”
Získať plný text

Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers Autor Orenstein, Yaron, Berger, Bonnie

“… As we prove that the problem is NP-hard, we give two solutions: the first is a greedy algorithm…”
Zistit podrobnosti o prístupe

Algorithms for Consistent Dynamic Labeling of Maps With a Time-Slider Interface Autor Bonerath, Annika, Driemel, Anne, Haunert, Jan-Henrik, Haverkort, Herman, Langetepe, Elmar, Niedermann, Benjamin

“… We present algorithms for setting up a data structure that encodes for every possible time window the set of displayed labels…”
Získať plný text

Joint IRS Location and Size Optimization in Multi-IRS Aided Two-Way Full-Duplex Communication Systems Autor Efrem, Christos N., Krikidis, Ioannis

“…Intelligent reflecting surfaces (IRSs) have emerged as a promising wireless technology for the dynamic configuration and control of electromagnetic waves, thus…”
Získať plný text

Load-balanced user associations in dense LTE networks Autor Biswas, Soumadip, Gupta, Arobinda, Chakraborty, Sandip

“…Minimizing the number of handovers incurred by a mobile User Equipment (UE) in a LTE network is an important and well-studied problem. In a dense LTE network,…”
Získať plný text

Mobility-Aware Participant Recruitment for Vehicle-Based Mobile Crowdsensing Autor Wang, Xiumin, Wu, Weiwei, Qi, Deyu

“… Utilizing the predicted mobility trajectory of vehicles, this paper aims to propose efficient vehicle recruitment algorithms for mobile crowdsensing, so as to minimize the overall recruitment…”
Získať plný text

Maximum Entropy Summary Trees Autor Karloff, Howard, Shirley, Kenneth E.

“…‐programming algorithm to compute this maximum entropy summary tree…”
Získať plný text

Optimal experimental design for sampling voltage on dendritic trees in the low-SNR regime Autor Huggins, Jonathan Hunter, Paninski, Liam

“… Our approach is to use a simple greedy algorithm with lazy evaluation to minimize the expected square error of the estimated spatiotemporal voltage signal…”
Získať plný text

Big Data Acquisition Under Failures in FiWi Enhanced Smart Grid Autor Guo, Hongzhi, Liu, Jiajia, Zhao, Lei

“…With the increasing of monitoring devices and advanced measurement infrastructures, smart grids (SGs) collect large amounts of data every moment, which gives…”
Získať plný text

Reliable Broadcast in Networks with Trusted Nodes Autor Tseng, Lewis, Wu, Yingjian, Pan, Haochen, Aloqaily, Moayad, Boukerche, Azzedine

“… We focus on Certified Propagation Algorithm (CPA), one of the simple algorithms that does not rely on a cryptographic infrastructure and has a proven guarantee on resilience…”
Získať plný text