Results 41 to 50 of about 4,841 (225)
Mendel, 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
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, EarlyView.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Low Cost Quality of Service Multicast Routing in High Speed Networks [PDF]
, 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
Advanced 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
Dijkstra’s Algorithm on Semigraph
WSEAS TRANSACTIONS ON COMPUTER RESEARCHThe 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
Automating AI Discovery for Biomedicine Through Knowledge Graphs and Large Language Models Agents
Advanced Intelligent Discovery, EarlyView.This work proposes a novel framework that automates biomedical discovery by integrating knowledge graphs with multiagent large language models. A biologically aligned graph exploration strategy identifies hidden pathways between biomedical entities, and specialized agents use this pathway to iteratively design AI predictors and wet‐lab validation ...
Naafey Aamer +3 more
wiley +1 more source
An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem [PDF]
, 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
Finding the Best QoS Path in a Gilbert Channel Network [PDF]
, 2008 Many different types of modern wired and wireless communication links can be mathematically described as discrete- time Gilbert channels. In this extended abstract, we present an exact method of calculating the best path in a network of discrete- time ...
Soedarmadji, Edwin
core +2 more sources
Business 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
Системный анализ и прикладная информатика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