Results 161 to 170 of about 2,188,345 (345)
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
The LLL-Algorithm: Lattice Basis Reduction in Polynomial Time
This thesis presents the Lenstra, Lenstra, and Lovász algorithm (more commonly the LLL-algorithm), which performs lattice basis reduction in polynomial time.
Peterson Lithell, Vilhelm
core
A machine learning method, opt‐GPRNN, is presented that combines the advantages of neural networks and kernel regressions. It is based on additive GPR in optimized redundant coordinates and allows building a representation of the target with a small number of terms while avoiding overfitting when the number of terms is larger than optimal.
Sergei Manzhos, Manabu Ihara
wiley +1 more source
A dynamic lot-sizing model with demand time windows
One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period.
Lee, C.Y. +2 more
core
Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems [PDF]
We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite ...
Berc Rustem +2 more
core
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning
This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley +1 more source
In this paper we investigate non-linear precoding solutions for the problem of broadband multiple-input multiple output(MIMO) systems. Based on a polynomial singular value decomposition (PSVD) we can decouple a broadband MIMO channel into independent ...
Al-Hanafy, Waleed, Weiss, S.
core
Composition‐Aware Cross‐Sectional Integration for Spatial Transcriptomics
Multi‐section spatial transcriptomics demands coherent cell‐type deconvolution, domain detection, and batch correction, yet existing pipelines treat these tasks separately. FUSION unifies them within a composition‐aware latent framework, modeling reads as cell‐type–specific topics and clustering in embedding space.
Qishi Dong +5 more
wiley +1 more source
A random polynomial time algorithm for approximating the volume of convex bodies
M. Dyer, A. Frieze, Ravi Kannan
semanticscholar +1 more source

