Search Results - greedy heuristic approximation algorithm

Refine Results
  1. 1

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

    ISSN: 0032-5910, 1873-328X
    Published: Elsevier B.V 01.12.2015
    Published in Powder technology (01.12.2015)
    “… 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…”
    Get full text
    Journal Article
  2. 2
  3. 3

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

    ISSN: 1063-6692, 1558-2566
    Published: New York IEEE 01.12.2008
    Published in IEEE/ACM transactions on networking (01.12.2008)
    “… 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…”
    Get full text
    Journal Article
  4. 4

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

    ISSN: 0377-2217, 1872-6860
    Published: Elsevier B.V 01.08.2022
    Published in European journal of operational research (01.08.2022)
    “…•A new local search algorithm with a performance guarantee.•Experiments with instances from the logit, mixed logit and nested logit models…”
    Get full text
    Journal Article
  5. 5

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

    ISSN: 1041-4347, 1558-2191
    Published: New York IEEE 01.08.2018
    “…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…”
    Get full text
    Journal Article
  6. 6

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

    ISSN: 0028-3045, 1097-0037
    Published: Hoboken, USA John Wiley & Sons, Inc 01.03.2022
    Published in Networks (01.03.2022)
    “… 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…”
    Get full text
    Journal Article
  7. 7

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

    ISSN: 0090-6778, 1558-0857
    Published: New York IEEE 01.03.2023
    Published in IEEE transactions on communications (01.03.2023)
    “…The software-defined network (SDN) enabled mobile edge network greatly facilitates network resource management and promotes many emerging applications…”
    Get full text
    Journal Article
  8. 8

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

    ISSN: 1386-7857, 1573-7543
    Published: Boston Springer US 01.12.2009
    Published in Cluster computing (01.12.2009)
    “… 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…”
    Get full text
    Journal Article
  9. 9

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

    ISSN: 2473-7585
    Published: IEEE 19.02.2024
    “…Emerging Internet architecture utilizes a pluralistic architectural paradigm in which multiple virtual overlay service networks are built on top of the…”
    Get full text
    Conference Proceeding
  10. 10

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

    ISSN: 1366-5545, 1878-5794
    Published: Exeter Elsevier India Pvt Ltd 01.12.2014
    “… This study is focused on developing heuristic approximation solutions, specifically the greedy-adding and greedy-adding with extension algorithms…”
    Get full text
    Journal Article
  11. 11

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

    ISSN: 2307-387X, 2307-387X
    Published: One Rogers Street, Cambridge, MA 02142-1209, USA MIT Press 01.07.2024
    “… 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…”
    Get full text
    Journal Article
  12. 12

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

    ISSN: 1557-8666, 1557-8666
    Published: United States 01.02.2016
    Published in Journal of computational biology (01.02.2016)
    “… As we prove that the problem is NP-hard, we give two solutions: the first is a greedy algorithm…”
    Get more information
    Journal Article
  13. 13

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

    ISSN: 1077-2626, 1941-0506, 1941-0506
    Published: United States IEEE 01.10.2025
    “… We present algorithms for setting up a data structure that encodes for every possible time window the set of displayed labels…”
    Get full text
    Journal Article
  14. 14

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

    ISSN: 1536-1276, 1558-2248
    Published: New York IEEE 01.10.2023
    “…Intelligent reflecting surfaces (IRSs) have emerged as a promising wireless technology for the dynamic configuration and control of electromagnetic waves, thus…”
    Get full text
    Journal Article
  15. 15

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

    ISSN: 1389-1286, 1872-7069
    Published: Amsterdam Elsevier B.V 22.04.2021
    “…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,…”
    Get full text
    Journal Article
  16. 16

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

    ISSN: 0018-9545, 1939-9359
    Published: New York IEEE 01.05.2018
    Published in IEEE transactions on vehicular technology (01.05.2018)
    “… 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…”
    Get full text
    Journal Article
  17. 17

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

    ISSN: 0167-7055, 1467-8659
    Published: Oxford, UK Blackwell Publishing Ltd 01.06.2013
    Published in Computer graphics forum (01.06.2013)
    “…‐programming algorithm to compute this maximum entropy summary tree…”
    Get full text
    Journal Article
  18. 18

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

    ISSN: 0929-5313, 1573-6873, 1573-6873
    Published: Boston Springer US 01.04.2012
    Published in Journal of computational neuroscience (01.04.2012)
    “… Our approach is to use a simple greedy algorithm with lazy evaluation to minimize the expected square error of the estimated spatiotemporal voltage signal…”
    Get full text
    Journal Article
  19. 19

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

    ISSN: 2168-6750, 2168-6750
    Published: New York IEEE 01.07.2019
    “…With the increasing of monitoring devices and advanced measurement infrastructures, smart grids (SGs) collect large amounts of data every moment, which gives…”
    Get full text
    Journal Article
  20. 20

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

    ISSN: 2576-6813
    Published: IEEE 01.12.2019
    “… 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…”
    Get full text
    Conference Proceeding