Search alternatives:
spatial scheduling » optimal scheduling (Expand Search)
using algorithm » cosine algorithm (Expand Search)
Showing 1 - 20 results of 326 for search '(((( spatial scheduling algorithm ) OR ( solved using algorithm ))) OR ( elements _ algorithm ))', query time: 0.10s Refine Results
  1. 1
    An algorithm for solving bond pricing problem

    An algorithm for solving bond pricing problem by Dibeh, Ghassan

    Published 2002
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  2. 2
    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem

    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

    Published 2018
    “…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  3. 3
    An evolutionary algorithm for solving the geometrically constrained site layout problem

    An evolutionary algorithm for solving the geometrically constrained site layout problem by Zouein, P.

    Published 2017
    “…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  4. 4
    A combined algorithm based on finite elements and a modified methodof characteristics for the analysis of the corona in wire-ductelectrostatic precipitators

    A combined algorithm based on finite elements and a modified methodof characteristics for the analysis of the corona in wire-ductelectrostatic precipitators by Al-Hamouz, Z.M.

    Published 2002
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  5. 5
    Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem

    Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

    Published 1998
    “…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  6. 6
    Modified clarke wright algorithms for solving the realistic vehicle routing problem

    Modified clarke wright algorithms for solving the realistic vehicle routing problem by Shour, Amina

    Published 2015
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  7. 7
    Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities

    Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities by Zouein, P. P.

    Published 2002
    “…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  8. 8
    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

    Published 2002
    “…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  9. 9
    Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams

    Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams by Eduardo Feo-Flushing (23276023)

    Published 2021
    “…Both combine a generic MILP solver and a genetic algorithm, resulting in efficient anytime algorithms. …”
    Save to List
    Saved in:
  10. 10
    Evolutionary algorithms for state justification in sequential automatic test pattern generation

    Evolutionary algorithms for state justification in sequential automatic test pattern generation by El-Maleh, Aiman H.

    Published 2005
    “…A common search operation in sequential Automatic Test Pattern Generation 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. …”
    Get full text
    article
    Save to List
    Saved in:
  11. 11
    CoLoSSI: Multi-Robot Task Allocation in Spatially-Distributed and Communication Restricted Environments

    CoLoSSI: Multi-Robot Task Allocation in Spatially-Distributed and Communication Restricted Environments by Ishaq Ansari (22047902)

    Published 2024
    “…We propose a cooperative, load-balancing task allocation and scheduling algorithm based on sequential single-item auctions (CoLoSSI) that explicitly considers the non-atomicity of tasks, promotes synergies between agents, and enables cooperation while maintaining computational tractability. …”
    Save to List
    Saved in:
  12. 12
    Using Fractional Bernoulli Wavelets for Solving Fractional Diffusion Wave Equations with Initial and Boundary Conditions

    Using Fractional Bernoulli Wavelets for Solving Fractional Diffusion Wave Equations with Initial and Boundary Conditions by Sahlan, Monireh Nosrati

    Published 2021
    Get full text
    article
    Save to List
    Saved in:
  13. 13
    MoveSchedule

    MoveSchedule by Zouein, Pierette

    Published 1995
    “…The timing of these needs is inferred from the activity schedule. 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. …”
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  14. 14
    Capturing outline of fonts using genetic algorithm and splines

    Capturing outline of fonts using genetic algorithm and splines by Sarfraz, M.

    Published 2001
    “…We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. We also incorporate a corner detection algorithm to detect significant points which are necessary to capture a pleasant looking spline fitting for shapes such as fonts. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  15. 15
    A method for the minimum coloring problem using genetic algorithms

    A method for the minimum coloring problem using genetic algorithms by Harmanani, Haidar

    Published 2006
    “…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  16. 16
    Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm

    Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm by Abido, M. A.

    Published 2005
    Get full text
    article
    Save to List
    Saved in:
  17. 17
    Environmental/economic power dispatch using multiobjective evolutionary algorithms

    Environmental/economic power dispatch using multiobjective evolutionary algorithms by Abido, M.A.

    Published 2003
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  18. 18
    A method for test scheduling using an evolutionary approach. (c2000)

    A method for test scheduling using an evolutionary approach. (c2000) by Noujaim, Jad

    Published 2000
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  19. 19
    Decomposition method for solving a nonlinear business cycle model

    Decomposition method for solving a nonlinear business cycle model by Dibeh, Ghassan

    Published 2003
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  20. 20
    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†

    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† by Harmanani, Haidar

    Published 2010
    “…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:

Search Tools: