Results 41 to 50 of about 305,625 (281)
Single failure resiliency in greedy routing [PDF]
, 2013 Using greedy routing, network nodes forward packets towards neighbors which are closer to their destination. This approach makes greedy routers significantly more memory-efficient than traditional IP-routers using longest-prefix matching.
Colle, Didier +4 more
core
Euclidean Greedy Drawings of Trees
, 2013 Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some ...
A. Rao +13 more
core +1 more source
Greedy sets and greedy numerical semigroups
Communications in AlgebraAccepted for publication in Communications in Algebra, Taylor and Francis group.
Pérez Rosés, Hebert +2 more
openaire +3 more sources
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
DesimalThe purpose of this research is to find a comparison of Bellman-Ford and Greedy algorithms to optimize the shortest route of PT Tiki Jalur Nugraha Ekakurir (JNE).
Riska Evita Putri Harahap, Ismail Husein
doaj +1 more source
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Exact and greedy algorithms of allocating experts to maximum set of programmer teams
Системный анализ и прикладная информатика, 2022 The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem.
A. A. Prihozhy
doaj +1 more source
Exploring Temporal Networks with Greedy Walks
, 2015 Temporal networks come with a wide variety of heterogeneities, from burstiness of event sequences to correlations between timings of node and link activations.
Holme, Petter, Saramaki, Jari
core +1 more source
Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 We consider the adaptive influence maximization problem: given a network and a budget k, iteratively select k seeds in the network to maximize the expected number of adopters. In the full-adoption feedback model, after selecting each seed, the seed-picker observes all the resulting adoptions.
Chen, Wei +3 more
openaire +3 more sources
AAA+ protein unfoldases—the Moirai of the proteome
FEBS Letters, EarlyView.AAA+ unfoldases are essential molecular motors that power protein degradation and disaggregation. This review integrates recent cryo‐electron microscopy (cryo‐EM) structures and single‐molecule biophysical data to reconcile competing models of substrate translocation.
Stavros Azinas, Marta Carroni
wiley +1 more source