Results 71 to 80 of about 973,180 (337)
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Xiaoge Zhang+5 more
doaj +1 more source
Application of the Logistics Management System Based on Cloud Computing Technology
In order to solve the vehicle routing optimization problem of cold chain logistics distribution, this paper proposes a vehicle routing optimization method of cold chain logistics distribution based on cloud computing technology.
Shuai Zhang
doaj +1 more source
Analysis of treatment‐naïve high‐grade serous ovarian carcinoma (HGSOC) and control tissues for ERVs, LINE‐1 (L1), inflammation, and immune checkpoints identified five clusters with diverse patient recurrence‐free survivals. An inflammation score was calculated and correlated with retroelement expression, where one novel cluster (Triple‐I) with high ...
Laura Glossner+6 more
wiley +1 more source
A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path. [PDF]
To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP).
Zhiqiang Xie, Xia Shao, Yu Xin
doaj +1 more source
Decrypting cancer's spatial code: from single cells to tissue niches
Spatial transcriptomics maps gene activity across tissues, offering powerful insights into how cancer cells are organised, switch states and interact with their surroundings. This review outlines emerging computational, artificial intelligence (AI) and geospatial approaches to define cell states, uncover tumour niches and integrate spatial data with ...
Cenk Celik+4 more
wiley +1 more source
A Global Path Planning Algorithm Based on Bidirectional SVGA
For path planning algorithms based on visibility graph, constructing a visibility graph is very time-consuming. To reduce the computing time of visibility graph construction, this paper proposes a novel global path planning algorithm, bidirectional SVGA (
Taizhi Lv, Chunxia Zhao, Jiancheng Bao
doaj +1 more source
Robot visual navigation estimation and target localization based on neural network
The high computational cost, complex external environment, and limited computing resources of embedded system are some major problems in traditional autonomous robot navigation methods.
Zhao Yanping+2 more
doaj +1 more source
On the computational complexity of path cover problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teofilo F. Gonzalez, Simeon Ntafos
openaire +3 more sources
Maximum Flux Transition Paths of Conformational Change
Given two metastable states A and B of a biomolecular system, the problem is to calculate the likely paths of the transition from A to B. Such a calculation is more informative and more manageable if done for a reduced set of collective variables chosen ...
Berkowitz M.+40 more
core +1 more source
Phenotypic plasticity in a newly established set of EGFR inhibitor‐adapted NSCLC cell lines during adaptation and in established cell lines. Here, we introduce novel sublines of the EGFR‐mutant non‐small cell lung cancer (NSCLC) cell lines HCC827 and HCC4006 adapted to the EGFR kinase inhibitors gefitinib (HCC827rGEFI2μm, HCC4006rGEFI1μm), erlotinib ...
Tharsagini V. Nanthaprakash+6 more
wiley +1 more source