Showing 1 - 20 results of 37 for search '(((( element data algorithm ) OR ( element g algorithm ))) OR ( spatial scheduling algorithm ))', query time: 0.12s Refine Results
  1. 1

    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. …”
  2. 2

    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. …”
  3. 3
  4. 4

    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
  5. 5
  6. 6

    Bird’s Eye View feature selection for high-dimensional data by Samir Brahim Belhaouari (16855434)

    Published 2023
    “…This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …”
  7. 7
  8. 8
  9. 9

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

    Published 2002
    “…Given a graph G = (V, E), a clique is a complete subgraph in G. …”
    Get full text
    Get full text
    article
  10. 10
  11. 11

    XBeGene: Scalable XML Documents Generator by Example Based on Real Data by Harazaki, Manami

    Published 2012
    “…Inspired by the query-by-example paradigm in information retrieval, Our generator system i)allows the user to provide her own sample XML documents as input, ii) analyzes the structure, occurrence frequencies, and content distributions for each XML element in the user input documents, and iii) produces synthetic XML documents which closely concur, in both structural and content features, to the user's input data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  12. 12
  13. 13

    A Data-Driven Decision-Making Framework for Fleet Management in the Government Sector of Dubai by ALGHANEM, HANI SUBHI MOHD

    Published 2024
    “…The proposed framework comprises key elements: Important Decisions derived from interviews with transportation leaders, Knowledge Management enhanced by AI algorithms, Data Mining/Analysis utilizing historical data, the Fleet Management System employing Oracle ERP, and a Data-Driven Decision Support Framework that leans towards the extended framework approach. …”
    Get full text
  14. 14

    Nonlinear analysis of shell structures using image processing and machine learning by M.S. Nashed (16392961)

    Published 2023
    “…The proposed approach can be significantly more efficient than training a machine learning algorithm using the raw numerical data. To evaluate the proposed method, two different structures are assessed where the training data is created using nonlinear finite element analysis. …”
  15. 15
  16. 16
  17. 17

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…Moreover, we allow the new vertex splitting operation, which allows the resulting clusters to overlap. In other words, data elements (or vertices) will be allowed to be members in more than one cluster instead of limiting them to only one single cluster, as in classical clustering methods. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  18. 18
  19. 19

    Assessment of static pile design methods and non-linear analysis of pile driving by Abou-Jaoude, Grace G.

    Published 2006
    “…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  20. 20

    A hybrid approach for XML similarity by Tekli, Joe

    Published 2007
    “…Various algorithms for comparing hierarchically structured data, e.g. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject