Results 81 to 90 of about 308,840 (315)
Selecting a distributed agreement algorithm [PDF]
Proceedings of the 2007 ACM symposium on Applied computing, 2007 When component parts of distributed systems need to reach agreement, arriving at consensus is difficult if some components don't behave properly. The Byzantine Generals Problem described by Lamport and others exemplifies the difficulty.In a real situation, components don't know which of their peers are faulty and hence they cannot apply the algorithms ...
Robert John Walters +2 more
openaire +1 more source
Molecular Oncology, EarlyView.Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski +12 more
wiley +1 more source
Distributed Graph Simulation: Impossibility and Possibility [PDF]
, 2014 This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
Improving the Delay Performance of CSMA Algorithms: A Virtual Multi-Channel Approach [PDF]
, 2013 CSMA algorithms have recently received a significant amount of interest in the literature for designing efficient wireless control algorithms. CSMA algorithms are attractive because they incur low computation complexity and communication overhead, and ...
Lin, Xiaojun +3 more
core +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
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cansell, Dominique, Méry, Dominique
openaire +2 more sources
Descriptive Combinatorics and Distributed Algorithms
Notices of the American Mathematical Society, 2022 This is a draft of an article to appear in the October 2022 issue of the Notices of the AMS. In this survey article we explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed algorithms -- a fundamental part of computer science that is becoming increasingly important in the modern era of ...
openaire +2 more sources
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 Consensus Approach to Distributed Convex Optimization in Multi-Agent Systems [PDF]
, 2013 In this thesis we address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where a network of agents, each endowed with local private convex cost and subject to communication constraints ...
Filippo Zanella, Zanella, Filippo
core
Efficient distributed approximation algorithms via probabilistic tree embeddings [PDF]
, 2012 We present a uniform approach to design efficient distributed approximation algorithms for various fundamental network optimization problems. Our approach is randomized and based on a probabilistic tree embedding due to Fakcharoenphol et al.
Khan, Maleq. +4 more
core +1 more source