Results 41 to 50 of about 15,993 (171)
Routing in triple loop circulants: A case of networks-on-chip
Heliyon, 2020 In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible ...
Aleksandr Yu. Romanov +1 more
doaj +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
Efficient motion planning for problems lacking optimal substructure
, 2017 We consider the motion-planning problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We
Hou, Brian +2 more
core +1 more source
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
Method of Path Selection in the Graph - Case Study [PDF]
TransNav, 2014 This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector.
Tomasz Neumann
doaj +1 more source
Route Planning in Transportation Networks [PDF]
, 2015 We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale.
Bast, Hannah +7 more
core
Half-Duplex Routing is NP-hard
, 2017 Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest Full-Duplex (FD ...
Cardone, Martina +3 more
core +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT The supply chain consists of interconnected businesses and organisations responsible for the flow of goods and services. As firms increasingly adopt digital technologies, the spillover effects of supply chain digitalisation (SCD) on environmental performance remain underexplored.
Zengdong Cao +4 more
wiley +1 more source
Strategic Impact of EU Taxonomy on Pharmaceutical Firms' Performance
Business Strategy and the Environment, EarlyView.ABSTRACT Sustainability has become a central concern in economic policy and corporate governance, increasingly formalised through regulatory frameworks of the European Union (EU). The European Commission has published the EU Taxonomy, which allows economic activities and their contribution to sustainability to be analysed, taking into account ...
Alicia Ramírez‐Orellana +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