يعرض 1 - 20 نتائج من 138 نتيجة بحث عن '(( element data algorithm ) OR ((( data code algorithm ) OR ( based approximation algorithm ))))', وقت الاستعلام: 0.14s تنقيح النتائج
  1. 1

    Approximation algorithms inspired by kernelization nethods حسب Abu-Khzam, Faisal N.

    منشور في 2017
    "…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  2. 2
  3. 3
  4. 4

    Data reductions and combinatorial bounds for improved approximation algorithms حسب Abu-Khzam, Faisal N.

    منشور في 2016
    "…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  5. 5

    Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks حسب Abu-Khzam, Faisal N.

    منشور في 2018
    "…We present a first distributed approximation algorithm for this problem. The algorithm achieves a constant approximation ratio if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded and takes O(Diam) rounds, where Diam is the diameter of the graph. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  6. 6

    Sample intelligence-based progressive hedging algorithms for the stochastic capacitated reliable facility location problem حسب Nezir Aydin (8355378)

    منشور في 2024
    "…Two commonly used SP methods are approximation methods, i.e., Sample Average Approximation (SAA), and decomposition methods, i.e., Progressive Hedging Algorithm (PHA). …"
  7. 7

    New Fast Arctangent Approximation Algorithm for Generic Real-Time Embedded Applications حسب Mohieddine Benammar (18103039)

    منشور في 2019
    "…The contributions of this work are summarized as follows: (1) introducing a new approximation algorithm with high precision and application-based flexibility; (2) introducing a new rational approximation formula that outperforms literature alternatives with the algorithm at higher accuracy requirement; and (3) presenting a practical evaluation index for rational approximations in the literature.…"
  8. 8

    Development of an Optimization Algorithm for Internet Data Traffic حسب Misbahuddin, Syed

    منشور في 2020
    "…The algorithm monitors data repetitions in IP datagram and prepares a compression code in response of this repetition. …"
    احصل على النص الكامل
    article
  9. 9

    Efficient Approximate Conformance Checking Using Trie Data Structures حسب Awad, Ahmed

    منشور في 2021
    "…In this paper, we contribute a new formulation of the proxy behavior derived from a model for approximate conformance checking. By encoding the proxy behavior using a trie data structure, we obtain a logarithmically reduced search space for alignment computation compared to a set-based representation. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
  10. 10

    Approximate XML structure validation based on document–grammar tree similarity حسب Tekli, Joe

    منشور في 2015
    "…While exact (Boolean) XML validation has been extensively investigated in the literature, the more general problem of approximate (similarity-based) XML validation, i.e., document–grammar similarity evaluation, has not yet received strong attention. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  11. 11
  12. 12

    Practical single node failure recovery using fractional repetition codes in data centers حسب Itani, May

    منشور في 2016
    "…FR codes consist of a concatenation of an outer maximum distance separable (MDS) code and an inner fractional repetition code that splits the data into several blocks and stores multiple replicas of each on different nodes in the system. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  13. 13

    Mixed precision iterative refinement with adaptive precision sparse approximate inverse preconditioning حسب Noaman Khan (19810050)

    منشور في 2025
    "…In this work, we develop an adaptive precision sparse approximate inverse preconditioner and demonstrate its use within a five-precision GMRES-based iterative refinement method. …"
  14. 14
  15. 15
  16. 16
  17. 17

    Belief selection in point-based planning algorithms for POMDPs حسب Azar, Danielle

    منشور في 2017
    "…Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value function can be derived by interpolation from the values of a specially selected set of points. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  18. 18

    Bird’s Eye View feature selection for high-dimensional data حسب Samir Brahim Belhaouari (16855434)

    منشور في 2023
    "…This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …"
  19. 19

    UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data حسب Behrouz Ahadzadeh (19757022)

    منشور في 2024
    "…UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. …"
  20. 20