Results 71 to 80 of about 4,253,766 (293)
Adaptive Discrete Vector Field in Sensor Networks
Sensors, 2018 Homology groups are a prime tool for measuring the connectivity of a network, and their computation in a distributed and adaptive way is mandatory for their use in sensor networks.
Mengyi Zhang, Alban Goupil
doaj +1 more source
An algorithm for distributive unification [PDF]
, 1996 The purpose of this paper is to describe a decision algorithm for unifiability of equations w.r.t. the equational theory of two distributive axioms: x*(y+z)=x*y+x*z and (x+y)*z=x*z + y*z. The algorithm is described as a set of non-deterministic transformation rules.
openaire +2 more sources
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V_r, and make
Stéphane Devismes +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Election algorithms with random delays in trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied.
Jean-François Marckert +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Detecting circulating tumor cells (CTCs) in blood before surgery may help predict outcomes in patients with head and neck squamous cell carcinoma (HNSCC). Here, we show when combined with tumor size and lymph node involvement from routine imaging, CTC status identifies high‐risk patients with poorer survival—offering a simple, minimally invasive tool ...
Susanne Flach +9 more
wiley +1 more source
A Framework for Distributed Evolutionary Algorithms [PDF]
, 2002 This paper describes the recently released DREAM (Distributed Resource Evolutionary Algorithm Machine) framework for the automatic distribution of evolutionary algorithm (EA) processing through a virtual machine built from large numbers of individual machines linked by standard Internet protocols.
Maribel García Arenas +7 more
openaire +3 more sources
Pragmatic distributed algorithm for spectral access in cooperative cognitive radio networks [PDF]
, 2014 A pragmatic distributed algorithm (PDA) is proposed for supporting the efficient spectral access of multiple Primary Users (PUs) and Cognitive Users (CUs) in cooperative Cognitive Radio (CR) networks. The novelty of our PDA is that the PUs negotiate with
Ng, S.X. +3 more
core +1 more source
Molecular Oncology, EarlyView.This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source