Results 71 to 80 of about 5,399,796 (309)
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
, 2023 We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in hypergraphs in the LOCAL model. A maximal matching of a hypergraph H=(V_H,E_H) is a maximal disjoint set M ⊆ E_H of hyperedges and an MIS S ⊆ V_H is a maximal set of nodes such that no hyperedge is fully contained in S.
Alkida Balliu +3 more
openaire +4 more sources
Maximizing the minimum completion time on parallel machines [PDF]
, 2008 We propose an exact branch-and-bound algorithm for the problem of maximizing the minimum machine completion time on identical parallel machines. The proposed algorithm is based on tight lower and upper bounds as well as an effective symmetry-breaking ...
Haouari, M., Jemmali, M.
core +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
A global method for some class of optimization and control problems
International Journal of Mathematics and Mathematical Sciences, 2000 The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed.
R. Enkhbat
doaj +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
BMC Bioinformatics, 2010 Background With the rapid development of new genetic measurement methods, several types of genetic alterations can be quantified in a high-throughput manner.
Fioretos Thoas +3 more
doaj +1 more source
Maximal independent sets in radio networks [PDF]
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, 2005 We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detection mechanism available. Specifically, we propose a novel randomized algorithm that computes a MIS in time O(log2!
Moscibroda, Thomas, Wattenhofer, Roger
openaire +3 more sources
Regret associated with past and future messes under a maximizing mind-set [PDF]
, 2016 Promotions can make you happy if you get the “best” deal or miserable if you miss it. Previous research on this topic has shown that people favor products associated with a past miss to products associated with a future miss, and people in a maximizing ...
Calisto, José Guilherme Faria
core
FEBS Letters, EarlyView.Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure +3 more
wiley +1 more source
Dynamic Maximal Independent Set
CoRR, 2019 Given a stream $\mathcal{S}$ of insertions and deletions of edges of an underlying graph $G$ (with fixed vertex set $V$ where $n=|V|$ is the number of vertices of $G$), we propose a dynamic algorithm that maintains a maximal independent set (MIS) of $G$ (at any time $t$ of the stream $\mathcal{S}$) with amortized update time $O(\log^3 n)$.
openaire +2 more sources