Results 71 to 80 of about 22,856,606 (379)
This article proposes the tracking algorithm based on density clustering of time scale and mesoscale eddy of Kalman filtering using the fused SLA data of altimeter.
Ji-Tao Li, Yong-Quan Liang
doaj +1 more source
Robust Flows over Time: Models and Complexity Results
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a certain ...
Gottschalk, Corinna +5 more
core +1 more source
Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networks [PDF]
We consider the problem of minimum-energy multicast using network coding in mobile ad hoc networks (MANETs). The optimal solution can be obtained by solving a linear program every time slot, but it leads to high computational complexity.
Effros, Michelle +2 more
core +1 more source
Bear management changes management actions according to the horizontal axis of the population size and the vertical axis of the number of nuisance bears. Aiming for the target population size of Ntar, Actions I and II protect the bears, and Action IV reduces the population.
Hiroyuki Matsuda +5 more
wiley +1 more source
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
In the context of distributed synchronous computing, processors perform in rounds, and the time-complexity of a distributed algorithm is classically defined as the number of rounds before all computing nodes have output.
A Korman +13 more
core +1 more source
Population size and dynamics fundamentally shape speciation by influencing genetic drift, founder events, and adaptive potential. Small populations may speciate rapidly due to stronger drift, whereas large populations harbor more genetic diversity, which can alter divergence trajectories. We highlight theoretical models that incorporate population size
Ryo Yamaguchi +3 more
wiley +1 more source
Exponential Time Complexity of Weighted Counting of Independent Sets
We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes x^k.
A.D. Scott +21 more
core +1 more source
Real-Time Single Image and Video Super-Resolution Using an Efficient Sub-Pixel Convolutional Neural Network [PDF]
Recently, several models based on deep neural networks have achieved great success in terms of both reconstruction accuracy and computational performance for single image super-resolution. In these methods, the low resolution (LR) input image is upscaled
Wenzhe Shi +7 more
semanticscholar +1 more source
Insights into PI3K/AKT signaling in B cell development and chronic lymphocytic leukemia
This Review explores how the phosphoinositide 3‐kinase and protein kinase B pathway shapes B cell development and drives chronic lymphocytic leukemia, a common blood cancer. It examines how signaling levels affect disease progression, addresses treatment challenges, and introduces novel experimental strategies to improve therapies and patient outcomes.
Maike Buchner
wiley +1 more source
Quantum Linear System Algorithm for General Matrices in System Identification
Solving linear systems of equations is one of the most common and basic problems in classical identification systems. Given a coefficient matrix A and a vector b, the ultimate task is to find the solution x such that Ax=b.
Kai Li +6 more
doaj +1 more source

