بدائل البحث:
method algorithm » mould algorithm (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
finding » findings (توسيع البحث)
method algorithm » mould algorithm (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
finding » findings (توسيع البحث)
-
101
Charge and reduce
منشور في 2015"…This leads to an algorithm whose running time is O(1.6181kn).…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
102
Evacuation of a highly congested urban city
منشور في 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 -
103
A data envelopment analysis model for opinion leaders’ identification in social networks
منشور في 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. …"
-
104
An Evolutionary Meta-Heuristic for State Justification in Sequential Automatic Test Pattern Generation
منشور في 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 -
105
An evolutionary meta-heuristic for state justification insequential automatic test pattern generation
منشور في 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 -
106
Assigning proctors to exams using scatter search. (c2006)
منشور في 2006احصل على النص الكامل
احصل على النص الكامل
masterThesis -
107
-
108
Fast, effective vertex cover kernelization
منشور في 2017احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
109
Efficient XML Structural Similarity Detection using Sub-tree Commonalities
منشور في 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 -
110
Approximate XML structure validation based on document–grammar tree similarity
منشور في 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 -
111
Metaheuristic Optimization‐Based Sliding Mode Control With Modified Perturb and Observe for Controlling MPPT of a PV Interfaced Grid Connected System
منشور في 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. …"
-
112
Corona power loss computation in bundled bipolar conductors
منشور في 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 -
113
Traffic Offloading with Channel Allocation in Cache-Enabled Ultra-Dense Wireless Networks
منشور في 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 -
114
Approximate XML structure validation technical report
منشور في 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 -
115
Oversampling techniques for imbalanced data in regression
منشور في 2024"…For tabular data, we also present the Auto-Inflater neural network, utilizing an exponential loss function for Autoencoders. …"
-
116
Scatter search technique for exam timetabling
منشور في 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 -
117
A smart decentralized identifiable distributed ledger technology‐based blockchain (DIDLT‐BC) model for cloud‐IoT security
منشور في 2024"…The primary purpose of the Blockchain Consent Algorithm (BCA) is to find solutions for numerous unreliable nodes with varying hash values. …"
-
118
-
119
MoveSchedule
منشور في 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 -
120
Dynamic Layout Planning Using a Hybrid Incremental Solution Method
منشور في 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