Results 11 to 20 of about 273,415 (267)
A dynamic separator algorithm [PDF]
, 1993 Our work is based on the pioneering work in sphere separators of Miller, Teng, Vavasis et al, [8, 12], who gave efficient static algorithms for finding sphere separators of size s(n)=O(nd−1/d) for a set of points in Rd.
Deganit Armon, John H. Reif
openaire +1 more source
On Alternative Algorithms for Computing Dynamic Mode Decomposition
Computation, 2022 Dynamic mode decomposition (DMD) is a data-driven, modal decomposition technique that describes spatiotemporal features of high-dimensional dynamic data.
Gyurhan Nedzhibov
doaj +1 more source
On Dynamic Algorithms for Algebraic Problems [PDF]
Journal of Algorithms, 1997 Summary: We examine the problem of incrementally evaluating algebraic functions. In particular, if \(f(x_1,x_2,\dots,x_n)=(y_1,y_2,\dots,y_m)\) is an algebraic problem, we consider answering on-line requests of the form ``change input \(x_i\) to value \(v\)'' or ``what is the value of output \(y_j\)? We first present lower bounds for some simply stated
John H. Reif, Stephen R. Tate
openaire +1 more source
Evolutionary algorithms and dynamic programming [PDF]
Proceedings of the 11th Annual conference on Genetic and evolutionary computation, 2009 Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which enables them to construct solutions in a dynamic programming fashion.
Benjamin Doerr +4 more
openaire +5 more sources
New algorithm for Mixmaster dynamics [PDF]
Classical and Quantum Gravity, 1997 12 pages, Revtex, 4 eps ...
Berger, Beverly K. +2 more
openaire +3 more sources
Small Stretch Spanners on Dynamic Graphs
Journal of Graph Algorithms and Applications, 2006 We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3-spanner or a 5-spanner under insertions and deletions of edges; on a graph with n ...
Giorgio Ausiello +2 more
doaj +1 more source
Dynamic Algorithms for Graph Coloring [PDF]
, 2018 We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(Δ+1)$- vertex coloring and $(2Δ-1)$-edge coloring in a graph with maximum degree $Δ$.
Sayan Bhattacharya +3 more
openaire +4 more sources
Composing dynamic programming tree-decomposition-based algorithms [PDF]
Discrete Mathematics & Theoretical Computer ScienceGiven two integers $\ell$ and $p$ as well as $\ell$ graph classes $\mathcal{H}_1,\ldots,\mathcal{H}_\ell$, the problems $\mathsf{GraphPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell,p)$, \break $\mathsf{VertPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell ...
Julien Baste
doaj +1 more source
Dynamic Programming Algorithms for Computing Optimal Knockout Tournaments
Mathematics, 2021 We study competitions structured as hierarchically shaped single-elimination tournaments. We define optimal tournaments by maximizing attractiveness such that the topmost players will have the chance to meet in higher stages of the tournament. We propose
Amelia Bădică +4 more
doaj +1 more source
The Annals of Applied Probability, 2010 Published in at http://dx.doi.org/10.1214/09-AAP617 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Mohamed, Hanene, Robert, Philippe
openaire +4 more sources