يعرض 1 - 20 نتائج من 108 نتيجة بحث عن '(( result graph algorithms ) OR ((( element data algorithm ) OR ( neural coding algorithm ))))', وقت الاستعلام: 0.13s تنقيح النتائج
  1. 1

    Topics in graph algorithms حسب Abu-Khzam, Faisal Nabih

    منشور في 2003
    "…We establish several (structural) results and discuss their potential algorithmic consequences. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  2. 2
  3. 3

    A dynamically turbo-charged heuristic for graph coloring. (c2018) حسب Chahine, Bachir

    منشور في 2018
    "…We launch a study on the dynamic form of the graph coloring problem proving it to be fixed-parameter tractable with respect to the edit-parameter. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    Heuristics for graph decomposition حسب Mansour, N.

    منشور في 2000
    "…The heuristic procedure that we propose is based on a hybrid genetic algorithm (HGA) for decomposing a graph followed by an iterative improvement heuristic for tuning the HGA's results. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14

    GENETIC SCHEDULING OF TASK GRAPHS حسب Benten, M. S.

    منشور في 2020
    "…A genetic algorithm for scheduling computational task graphs is presented. …"
    احصل على النص الكامل
    article
  15. 15

    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. …"
  16. 16

    Partitioning a graph into degenerate subgraphs حسب Abu-Khzam, Faisal N.

    منشور في 2018
    "…In this paper, we prove that we can find a (p1, . . . , ps)-partition of G in O(|V| + |E|)-time whenever 1 ≥ p1, . . . , ps ≥ 0 and ∑s i=1 pi ≥ k − s. This generalizes a result of Bonamy et al. (2017) and can be viewed as an algorithmic extension of Brooks’ Theorem and several results on vertex arboricity of graphs of bounded maximum degree. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  17. 17

    Graph contraction for physical optimization methods حسب Mansour, Nashat

    منشور في 1993
    "…We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, Genetic Algorithm and Simulated Annealing. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  18. 18

    Graph Contraction for Mapping Data on Parallel Computers حسب Mansour, N.

    منشور في 1994
    "…We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, genetic algorithm and simulated annealing. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  19. 19

    A linear programming approach for the weighted graph matchingproblem حسب Almohamad, H.A.

    منشور في 1993
    "…A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  20. 20