Results 41 to 50 of about 16,130 (172)

Retinal Vessel Segmentation: A Comprehensive Review From Classical Methods to Deep Learning Advances (1982–2025)

open access: yesAdvanced Intelligent Systems, EarlyView.
Four decades of retinal vessel segmentation research (1982–2025) are synthesized, spanning classical image processing, machine learning, and deep learning paradigms. A meta‐analysis of 428 studies establishes a unified taxonomy and highlights performance trends, generalization capabilities, and clinical relevance.
Avinash Bansal   +6 more
wiley   +1 more source

Revision of Specification Automata under Quantitative Preferences [PDF]

open access: yes, 2014
We study the problem of revising specifications with preferences for automata based control synthesis problems. In this class of revision problems, the user provides a numerical ranking of the desirability of the subgoals in their specifications.
Fainekos, Georgios, Kim, Kangjin
core   +1 more source

Strategic Impact of EU Taxonomy on Pharmaceutical Firms' Performance

open access: yesBusiness 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

Digital Dynamic Capabilities and Environmental Sustainability: The Role of Circular Supply Chain Practices

open access: yesCorporate Social Responsibility and Environmental Management, EarlyView.
ABSTRACT This study explores how digital dynamic capabilities (DDC)—specifically digital absorptive capacity (DAC) and digital transformation capacity (DTC)—contribute to environmental sustainability (ES), both directly and through circular supply chain practices (CSCP).
Yi Liang, Tae‐Hoo Kim, Min‐Jae Lee
wiley   +1 more source

Method of Path Selection in the Graph - Case Study [PDF]

open access: yesTransNav, 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

Efficient motion planning for problems lacking optimal substructure

open access: yes, 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

Non‐Uniform Programmable Photonic Waveguide Meshes

open access: yesLaser &Photonics Reviews, EarlyView.
Integrating defect cells into uniform hexagonal waveguide meshes overcomes the fundamental spectral and temporal limitations of programmable photonics. By leveraging the Vernier effect through non‐uniform coupled cavities, this architecture achieves a tenfold increase in free spectral range and ultra‐fast sampling times, paving the way for next ...
Cristina Catalá‐Lahoz, José Capmany
wiley   +1 more source

Route Planning in Transportation Networks [PDF]

open access: yes, 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  

Proteome Analysis of Corynebacterium diphtheriae–Macrophage Interaction

open access: yesPROTEOMICS, EarlyView.
ABSTRACT Contact of Corynebacterium diphtheriae with macrophages induces adaptations on both bacterial and cellular sides. The study presented here was aiming to shed light on the simultaneous intracellular adaptation of the bacteria and changes in the proteome of the phagocytes in response to the internalization of C. diphtheriae.
Luca Musella   +6 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

Home - About - Disclaimer - Privacy