بدائل البحث:
method algorithm » mould algorithm (توسيع البحث)
would algorithm » mould algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
يعرض 361 - 380 نتائج من 631 نتيجة بحث عن '(((( data would algorithm ) OR ( problem using algorithm ))) OR ( elements method algorithm ))', وقت الاستعلام: 0.12s تنقيح النتائج
  1. 361
  2. 362

    Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams حسب Eduardo Feo-Flushing (23276023)

    منشور في 2021
    "…Both combine a generic MILP solver and a genetic algorithm, resulting in efficient anytime algorithms. …"
  3. 363
  4. 364

    An Artificial Intelligence Approach for Predictive Maintenance in Electronic Toll Collection System حسب Alkhatib, Osama

    منشور في 2019
    "…Experiment is performed using Azure Machine Learning (ML) platform to test and assess the most efficient model that would predict the failure of system elements and predict the abnormality of the operation. …"
    احصل على النص الكامل
  5. 365
  6. 366
  7. 367
  8. 368

    A Biologicaly Inspired Decision Model for Multivariable Genetic- Fuzzy-AHP System حسب Kouatli, Issam

    منشور في 2016
    "…The proposed GFT mechanism can be applied to any decision making problem within an uncertain environment. One example would be the determination of CRM performance measurement given a variety of inputs related to marketing, data mining tools, ordered materials and communication.…"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  9. 369

    Decomposition-based wind power forecasting models and their boundary issue: An in-depth review and comprehensive discussion on potential solutions حسب Yinsong Chen (16685508)

    منشور في 2022
    "…These methods generally disaggregate the original time series data into sub-time-series with better stationarity, and then the target data is predicted based on the sub-series. …"
  10. 370

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

    منشور في 2001
    "…A common search optimization in sequential ATPG is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …"
    احصل على النص الكامل
    article
  11. 371

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

    منشور في 2001
    "…A common search operation in sequential ATPG is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  12. 372

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

    منشور في 1994
    "…We restrict our discussion to applications where the problem domain can be described using a graph (e.g., computational fluid dynamics applications). …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  13. 373

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

    منشور في 1993
    "…We restrict our discussion to applications where the problem domain can be described using a graph (e.g., computational fluid dynamics applications). …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  14. 374

    HPTS: heterogeneous parallel tabu search for VLSI placement حسب Al-Yamani, A.

    منشور في 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  15. 375

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

    منشور في 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  16. 376

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

    منشور في 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). …"
    احصل على النص الكامل
    article
  17. 377

    Four-dimensional representation and collision detection for movingobjects حسب Aliyu, M.D.S.

    منشور في 1998
    "…Simulation results on some example problems are given, and show that the algorithm is superior to those available in the literature…"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  18. 378

    Communications in electronic textile systems حسب Nakad, Z.

    منشور في 2017
    "…Abstract- Electronic textiles (e-textiles) are emerging as a novel method for constructing electronic systems in wearable and large area applications. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  19. 379

    Meta Reinforcement Learning for UAV-Assisted Energy Harvesting IoT Devices in Disaster-Affected Areas حسب Marwan Dhuheir (19170898)

    منشور في 2024
    "…We conducted extensive simulations and compared our approach with two state-of-the-art models using traditional RL algorithms represented by a deep Q-network algorithm, a Particle Swarm Optimization (PSO) algorithm, and one greedy solution. …"
  20. 380

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

    منشور في 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. …"
    احصل على النص الكامل
    article