Search alternatives:
modelling algorithm » scheduling algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
Showing 581 - 600 results of 906 for search '(( elements method algorithm ) OR ((( data modelling algorithm ) OR ( problem using algorithm ))))', query time: 0.13s Refine Results
  1. 581
    Parallel processing

    Parallel processing by Mansour, Nashat

    Published 2005
    “…Parallel algorithms, based on simulated annealing, neural networks and genetic algorithms, for mapping irregular data to multicomputers are presented and compared. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  2. 582
    Computation of conformal invariants

    Computation of conformal invariants by Mohamed M.S., Nasser

    Published 2020
    “…A characteristic feature of this method is that, with small changes in the code, a wide spectrum of problems can be treated. We compare the performance and accuracy to previous results in the cases when numerical data is available and also in the case of several model problems where exact results are available.…”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  3. 583
    Generic metadata representation framework for social-based event detection, description, and linkage

    Generic metadata representation framework for social-based event detection, description, and linkage by Abebe, Minale A.

    Published 2020
    “…SEDDaL consists of four main modules for: i) describing social media objects in a generic Metadata Representation Space Model (MRSM) consisting of three composite dimensions: temporal, spatial, and semantic, ii) evaluating the similarity between social media objects’ descriptions following MRSM, iii) detecting events from similar social media objects using an adapted unsupervised learning algorithm, where events are represented as clusters of objects in MRSM, and iv) identifying directional, metric, and topological relationships between events following MRSM’s dimensions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  4. 584
    Graph Contraction for Mapping Data on Parallel Computers

    Graph Contraction for Mapping Data on Parallel Computers by Mansour, N.

    Published 1994
    “…We restrict our discussion to applications where the problem domain can be described using a graph (e.g., computational fluid dynamics applications). …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  5. 585
    Vehicular-OBUs-As-On-Demand-Fogs

    Vehicular-OBUs-As-On-Demand-Fogs by Sami, Hani

    Published 2020
    “…An Evolutionary Memetic Algorithm is elaborated to solve our vehicular container placement problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  6. 586
    Joint computing, communication and cost-aware task offloading in D2D-enabled Het-MEC

    Joint computing, communication and cost-aware task offloading in D2D-enabled Het-MEC by Abbas, Nadine

    Published 2022
    “…Compared to conventional and state-of-the-art system models, results show the effectiveness of the proposed schemes and provide useful insights into the tradeoffs between the number of completed tasks, energy consumption and monetary cost.…”
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  7. 587
    Graph contraction for physical optimization methods

    Graph contraction for physical optimization methods by Mansour, Nashat

    Published 1993
    “…We restrict our discussion to applications where the problem domain can be described using a graph (e.g., computational fluid dynamics applications). …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  8. 588
    Indoor Localization Schemes for Mobile Robots

    Indoor Localization Schemes for Mobile Robots by Al-Jarrah, Islam Mohammad-Amin

    Published 2010
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  9. 589
    HPTS: heterogeneous parallel tabu search for VLSI placement

    HPTS: heterogeneous parallel tabu search for VLSI placement by Al-Yamani, A.

    Published 2002
    “…Two parallelization strategies, i.e., functional decomposition and multi-search thread strategies are integrated. The proposed algorithm is tested on the VLSI standard cell placement problem, however, the same algorithm can be used on any combinatorial optimization problem. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  10. 590
    A linear programming approach for the weighted graph matchingproblem

    A linear programming approach for the weighted graph matchingproblem by Almohamad, H.A.

    Published 1993
    “…The linear program is solved using a simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  11. 591
    Joint Planning of Smart EV Charging Stations and DGs in Eco-Friendly Remote Hybrid Microgrids

    Joint Planning of Smart EV Charging Stations and DGs in Eco-Friendly Remote Hybrid Microgrids by Shaaban, Mostafa

    Published 2019
    “…This is achieved by iteratively solving a multi-objective mixed integer non-linear program. An outer sub-problem determines the locations and sizes of the DG units and charging stations using a non-dominated sorting Genetic algorithm (NSGA-II). …”
    Get full text
    article
    Save to List
    Saved in:
  12. 592
    Computation of conformal invariants

    Computation of conformal invariants by Mohamed M.S. Nasser (16931772)

    Published 2021
    “…A characteristic feature of this method is that, with small changes in the code, a wide spectrum of problems can be treated. We compare the performance and accuracy to previous results in the cases when numerical data is available and also in the case of several model problems where exact results are available.…”
    Save to List
    Saved in:
  13. 593
    Four-dimensional representation and collision detection for movingobjects

    Four-dimensional representation and collision detection for movingobjects by Aliyu, M.D.S.

    Published 1998
    “…Simulation results on some example problems are given, and show that the algorithm is superior to those available in the literature…”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  14. 594
    Communications in electronic textile systems

    Communications in electronic textile systems by Nakad, Z.

    Published 2017
    “…Abstract- Electronic textiles (e-textiles) are emerging as a novel method for constructing electronic systems in wearable and large area applications. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  15. 595
    Prediction of Multiple Clinical Complications in Cancer Patients to Ensure Hospital Preparedness and Improved Cancer Care

    Prediction of Multiple Clinical Complications in Cancer Patients to Ensure Hospital Preparedness and Improved Cancer Care by Regina Padmanabhan (14231606)

    Published 2022
    “…Other highlights are (1) a novel set of easily available features for the prediction of the aforementioned clinical complications and (2) the use of data augmentation methods and model-scoring-based hyperparameter tuning to address the problem of class disproportionality, a common challenge in medical datasets and often the reason behind poor event prediction rate of various predictive models reported so far. …”
    Save to List
    Saved in:
  16. 596
    Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine

    Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine by Duffuaa, S. O.

    Published 2020
    “…In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. …”
    Get full text
    article
    Save to List
    Saved in:
  17. 597
    On Single Source Reachability Improvement

    On Single Source Reachability Improvement by Alkak, Hashem

    Published 2022
    “…We show the NP­ hardness and present an effective polynomial-time greedy algorithm. Experimental evaluation of our greedy algorithm is conducted on randomly generated graphs, using the Erdos-Renyi approach. …”
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  18. 598
    Shuffled Linear Regression with Erroneous Observations

    Shuffled Linear Regression with Erroneous Observations by Saab, Samer S.

    Published 2019
    “…This paper tackles this problem in its full generality using stochastic approximation, which is based on a first-order permutation-invariant constraint. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  19. 599
    Unit commitment by tabu search

    Unit commitment by tabu search by Mantawy, A.H.

    Published 1998
    “…The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  20. 600
    Final exams scheduling for univeristies. (c2001)

    Final exams scheduling for univeristies. (c2001) by Timany, Mazen Nuhad

    Published 2001
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:

Search Tools: