Results 81 to 90 of about 32,185 (303)
Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network
, 2005 Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms.
Wu, Q, Al-Dabass, D, Hartley, JK
core
Advanced Materials, EarlyView.Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Revisiting Volgenant-Jonker for Approximating Graph Edit Distance [PDF]
, 2015 Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task.
Andy King +5 more
core +1 more source
Opportunities of Semiconducting Oxide Nanostructures as Advanced Luminescent Materials in Photonics
Advanced Materials, EarlyView.The review discusses the challenges of wide and ultrawide bandgap semiconducting oxides as a suitable material platform for photonics. They offer great versatility in terms of tuning microstructure, native defects, doping, anisotropy, and micro‐ and nano‐structuring. The review focuses on their light emission, light‐confinement in optical cavities, and
Ana Cremades +7 more
wiley +1 more source
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
Jurnal Informatika, 2005 A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj
An Efficient Algorithm for Touring n Circles
MATEC Web of Conferences, 2018 This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting circle sequences in the plane. The problem is transformed to a corresponding problem of computing the shortest path of three disjoint circles.
Ding Yuepeng, Xie Xiong, Jiang Bo
doaj +1 more source
Distributed algorithms from arboreal ants for the shortest path problem. [PDF]
Proc Natl Acad Sci U S A, 2023 Garg S +3 more
europepmc +1 more source
Advanced Materials, EarlyView.Drawing inspiration from the layered hard‐soft architecture found in sea sponges, this work establishes a new framework for architected cementitious composites (ACC) through multi‐material additive manufacturing (MMAM) process. The integration of mortar and elastomer phases into layered architectures enables synergistic toughening mechanisms, including
Aimane Najmeddine +5 more
wiley +1 more source
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
An oblivious shortest-path routing algorithm for fully connected cubic networks
, 2006 Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability.
Yang, X. +5 more
core +1 more source