يعرض 101 - 120 نتائج من 174 نتيجة بحث عن '(( elements method algorithm ) OR ((( time finding algorithm ) OR ( neural coding algorithm ))))', وقت الاستعلام: 0.12s تنقيح النتائج
  1. 101
  2. 102

    Evacuation of a highly congested urban city حسب El Khoury, John

    منشور في 2017
    "…The algorithm uses Dijkstras algorithm to find the shortest path(s) and a modified greedy algorithm to assign maximum flows to selected paths given a specific schedule per time interval. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  3. 103

    A data envelopment analysis model for opinion leaders’ identification in social networks حسب Hamed Baziyad (19273738)

    منشور في 2024
    "…The graph-based methods are one of the most important approaches for finding OLs in OSNs. Social Network Analysis (SNA)-based OLs finding methods deal with a considerable amount of data due to using entire relationships between all of the users in a network, which makes the algorithms time-consuming. …"
  4. 104

    An Evolutionary Meta-Heuristic for State Justification in Sequential Automatic Test Pattern Generation حسب El-Maleh, Aiman H.

    منشور في 2001
    "…In this work, we propose a hybrid approach which uses a combination of evolutionary and deterministic algorithms for state justification. A new method based on Genetic algorithms is proposed, in which we engineer state justification sequences vector by vector. …"
    احصل على النص الكامل
    article
  5. 105

    An evolutionary meta-heuristic for state justification insequential automatic test pattern generation حسب El-Maleh, A.H.

    منشور في 2001
    "…In this work, we propose a hybrid approach which uses a combination of evolutionary and deterministic algorithms for state justification. A new method based on Genetic Algorithms is proposed, in which we engineer state justification sequences vector by vector. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  6. 106
  7. 107
  8. 108
  9. 109

    Efficient XML Structural Similarity Detection using Sub-tree Commonalities حسب Tekli, Joe

    منشور في 2007
    "…Developing efficient techniques for comparing XML-based documents becomes essential in the database and information retrieval communities. Various algorithms for comparing hierarchically structured data, e.g. …"
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  10. 110

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

    منشور في 2015
    "…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?…"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  11. 111

    Metaheuristic Optimization‐Based Sliding Mode Control With Modified Perturb and Observe for Controlling MPPT of a PV Interfaced Grid Connected System حسب Anupama Ganguly (22502969)

    منشور في 2025
    "…Also, the proposed hybrid (MGO‐MPb&O) is compared with two other hybrid control topologies that are (PSO‐MPb&O) and (cuckoo search algorithm [CSA]‐MPb&O) in terms of maximum power extracted, efficiency, and convergence time of the objective function. …"
  12. 112

    Corona power loss computation in bundled bipolar conductors حسب Al-Hamouz, Z.M.

    منشور في 2000
    "…In this paper, a finite element (FE) based algorithm devoted for the computation of the corona current and hence the corona power loss associated with bundled bipolar high voltage direct current (HVDC) conductors is presented. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  13. 113

    Traffic Offloading with Channel Allocation in Cache-Enabled Ultra-Dense Wireless Networks حسب Abbas, Nadine

    منشور في 2018
    "…We also propose efficient sub-optimal hierarchical tree-based algorithms that operate in real time with dynamic and fast solutions for ultra dense networks. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  14. 114

    Approximate XML structure validation technical report حسب Tekli, Joe

    منشور في 2014
    "…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?…"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  15. 115

    Oversampling techniques for imbalanced data in regression حسب Samir Brahim Belhaouari (9427347)

    منشور في 2024
    "…For tabular data, we also present the Auto-Inflater neural network, utilizing an exponential loss function for Autoencoders. …"
  16. 116

    Scatter search technique for exam timetabling حسب Mansour, Nashat

    منشور في 2011
    "…Hence, solving this problem in realistic time requires the use of heuristic approaches. In this work, we develop an evolutionary heuristic technique based on the scatter search approach for finding good suboptimal solutions for exam timetabling. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  17. 117

    A smart decentralized identifiable distributed ledger technology‐based blockchain (DIDLT‐BC) model for cloud‐IoT security حسب Shitharth Selvarajan (14157976)

    منشور في 2024
    "…The primary purpose of the Blockchain Consent Algorithm (BCA) is to find solutions for numerous unreliable nodes with varying hash values. …"
  18. 118
  19. 119

    MoveSchedule حسب Zouein, Pierette

    منشور في 1995
    "…The layout construction algorithm that underlies MoveSchedule uses Constraint Satisfaction to find the set of all positions that meet the constraints on resources' positions and Linear Programming to find the optimal positions that minimize resource transportation and relocation costs. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  20. 120

    Dynamic Layout Planning Using a Hybrid Incremental Solution Method حسب Zouein, Pierrette

    منشور في 1999
    "…Solving it involves creating a sequence of layouts that span the entire project duration, given resources, the timing of their presence on site, their changing demand for space over time, constraints on their location, and costs for their relocation. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article