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

    The Frontiers of Deep Reinforcement Learning for Resource Management in Future Wireless HetNets: Techniques, Challenges, and Research Directions by Abdulmalik Alwarafy (17984104)

    Published 2022
    “…Then, we provide a comprehensive review of the most widely used DRL algorithms to address RRAM problems, including the value- and policy-based algorithms. …”
  2. 622

    Deep Reinforcement Learning for Resource Constrained HLS Scheduling by Makhoul, Rim

    Published 2022
    “…In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. The actions and rewards for the proposed algorithm are selected carefully to guide the agent to its objective. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  3. 623

    Fast force-directed/simulated evolution hybrid for multiobjective VLSI cell placement by Sait, Sadiq M.

    Published 2004
    “…In this work, a fast hybrid algorithm is designed to address this problem. The algorithm employs simulated evolution (SE), an iterative search heuristic that comprises three steps: evaluation, selection and allocation. …”
    Get full text
    Get full text
    article
  4. 624

    Reliability and fault tolerance based topological optimization of computer networks - part I: enumerative techniques by Abd-El-Barr, Mostafa

    Published 2003
    “…Experimental results obtained from a set of randomly generated networks using the proposed algorithms are presented and compared to those obtained using existing techniques. …”
    Get full text
    Get full text
    article
  5. 625

    Faces in the crowd by Abu-Khzam, Faisal N.

    Published 2017
    “…We show how to obtain an outerplanar subgraph of a graph of disk dimension k by removing at most 2k − 2 vertices. We use this reduction technique to obtain a tree-decomposition of width at most 2k and a linear-time 3-approximation algorithm for the pathwidth problem on graphs of fixed disk dimension. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  6. 626
  7. 627

    Assessing the potential of network reconfiguration to improve distributed generation hosting capacity in active distribution systems by Margossian, Harag

    Published 2014
    “…This work further proposes an algorithm to break-down the large problem size when many periods have to be considered. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  8. 628

    A forward-backward Kalman for the estimation of time-variant channels in OFDM by Al-Naffouri, T.Y.

    Published 2005
    “…In this paper, we propose an expectation-maximization (EM) algorithm for joint channel and data recovery. The algorithm makes use of the rich structure of the underlying communication problem-a structure induced by the data and channel constraints. …”
    Get full text
    Get full text
    article
  9. 629

    Parallel tabu search in a heterogeneous environment by Al-Yamani, A.

    Published 2003
    “…The multiobjective nature of this problem is addressed using a fuzzy goal-based cost computation.…”
    Get full text
    Get full text
    article
  10. 630

    Identification of physically based models of residential air-conditioners for direct load control management by El-Ferik, S.

    Published 2004
    “…In this work, we address the problem of identifying the parameters of an aggregated elemental model representing a housing unit with an A/C system. …”
    Get full text
    Get full text
    article
  11. 631
  12. 632

    Protein structure prediction in the 3D HP model by Abu-Khzam, Faisal

    Published 2009
    “…To test our algorithm, we use two sets of benchmark sequences of different lengths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  13. 633

    Data Generation for Path Testing by Mansour, Nashat

    Published 2004
    “…These algorithms are based on an optimization formulation of the path testing problem which include both integer- and real-value test cases. …”
    Get full text
    Get full text
    Get full text
    article
  14. 634
  15. 635

    FAST FUZZY FORCE-DIRECTED/SIMULATED EVOLUTION METAHEURISTIC FOR MULTIOBJECTIVE VLSI CELL PLACEMENT by Sait, Sadiq M.

    Published 2006
    “…VLSI standard cell placement is the process of arranging circuit components (modules) on a silicon layout. The cell placement problem is a proven NP hard combinatorial optimization problem. …”
    Get full text
    article
  16. 636

    A nash bargaining solution for energy-efficient content distribution over wireless networks with mobile-to-mobile cooperation by Yaacoub, Elias

    Published 2018
    “…Furthermore, a low complexity utility minimization algorithm is presented. Using the appropriate utilities, the proposed algorithm is used to implement both the proposed solution in addition to the greedy energy minimization solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  17. 637
  18. 638

    Optimization metaheuristic for software testing by Mansour, Nashat

    Published 2013
    “…We formulate the web application testing problem as an optimization problem and use a simulated annealing (SA) metaheuristic algorithm to generate test cases as sequences of events while keeping the test suite size reasonable. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  19. 639

    A combinatorial auction‐based approach for ridesharing in a student transportation system by Chefi Triki (14158860)

    Published 2023
    “…A hybrid heuristic-based optimization framework, that takes advantage of meta-heuristic algorithms to improve an initial solution, is also developed to solve large-sized instances of the problem. …”
  20. 640

    Dynamic multiple node failure recovery in distributed storage systems by Itani, May

    Published 2018
    “…The contribution of this paper is four-fold: i. we generate an optimized block distribution scheme that minimizes the total system repair cost of all dependent and independent multiple node failure scenarios; ii. we address the practical scenario of having newly arriving blocks and allocate those blocks to existing nodes without any modification to the original on-node block distribution; iii. we consider new-comer nodes and generate an updated optimized block distribution; iv. we consider optimized storage and recovery of blocks with varying priority using variable fractional repetition codes. The four problems are modeled using incidence matrices and solved heuristically. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article