Results 41 to 50 of about 4,817 (226)

Explanation and Speedup Comparison of Advanced Path-planning Algorithms Presented on Two-dimensional Grid

open access: yesMendel, 2022
Path planning or network route planning problems are an important issue in AI, robotics, or computer games. Appropriate implementation and knowledge of advanced and classical path-planning algorithms can be important for both autonomous navigation ...
Petr Soustek   +3 more
doaj   +1 more source

What to Make and How to Make It: Combining Machine Learning and Statistical Learning to Design New Materials

open access: yesAdvanced Intelligent Discovery, EarlyView.
Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley   +1 more source

NNIR: N-Non-Intersecting-Routing Algorithm for Multi-Path Resilient Routing in Telecommunications Applications

open access: yesInternational Journal of Computational Intelligence Systems, 2020
In this paper, we will present a N-Non-Intersecting-Routing (NNIR) algorithm which is used to reduce the cost of resilient routing in telecommunications problems.
Lewis Veryard   +4 more
doaj   +1 more source

An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem [PDF]

open access: yes, 2010
The Multi-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm ...
Imran, A. (Arif)
core  

Multiobjective Environmental Cleanup with Autonomous Surface Vehicle Fleets Using Multitask Multiagent Deep Reinforcement Learning

open access: yesAdvanced Intelligent Systems, EarlyView.
This study presents a multitask strategy for plastic cleanup with autonomous surface vehicles, combining exploration and cleaning phases. A two‐headed Deep Q‐Network shared by all agents is traineded via multiobjective reinforcement learning, producing a Pareto front of trade‐offs.
Dame Seck   +4 more
wiley   +1 more source

Dijkstra’s Algorithm on Semigraph

open access: yesWSEAS TRANSACTIONS ON COMPUTER RESEARCH
The study of graph theory helps us in understanding the relationship between two nodes. Semigraphs are generalizations of graphs where the relationship occurs between more than two nodes. It provides solutions to issues with layout, matching, networking, optimization, etc.
Pranjal Sen   +4 more
openaire   +1 more source

European Ports as Energy Hubs: A Sustainability Index to Assess Territorial Development

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT The capacity of ports to act as energy hubs is increasingly relevant in light of sustainability challenges and global crises like the Ukraine conflict, the COVID‐19 pandemic and energy scarcity. Numerous international and national initiatives are shaping the future of port development to address environmental and economic concerns.
Paolo Mazzocchi   +3 more
wiley   +1 more source

Green Human Resource Management and Employee Green Behaviour in Hotels: Mediating Roles of Job Satisfaction and Work Well‐Being

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT This study investigates the impact of green human resource management (GHRM) practices on employee green behavioural intention (GBI) and in‐role green behaviour (EGB‐IR) in the hospitality sector. Drawing on conservation of resources (COR) theory, we examine the mediating roles of job satisfaction and employee well‐being as psychological ...
Vanessa Guerra‐Lombardi   +3 more
wiley   +1 more source

Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison

open access: yesСистемный анализ и прикладная информатика
In this paper we consider two families of competing algorithms for finding the shortest paths between all pairs of vertices (APSP) in directed weighted large graphs with different edge densities: Dijkstra and Floyd-Warshall. For comparison, we have taken
A. A. Prihozhy, O. N. Karasik
doaj   +1 more source

Low Cost Quality of Service Multicast Routing in High Speed Networks [PDF]

open access: yes, 1997
Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or ...
Crawford, John, Waters, A. Gill
core   +1 more source

Home - About - Disclaimer - Privacy