Suchergebnisse - 68W01 General topics in the theory of algorithms

Independent Set Reconfiguration Under Bounded-Hop Token

Autoren: Hatano, Hiroki Kitamura, Naoki Izumi, Taisuke et al.

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 68W01 General topics in the theory of algorithms

Zugangs-URL: http://arxiv.org/abs/2407.11768

Comparing Algorithms for Sorting with t Stacks in Series: Comparing algorithms for sorting with \(t\) stacks in series

Autoren: Rebecca Smith

Quelle: Annals of Combinatorics. 8:113-121

Schlagwörter: Permutations, words, matrices, General topics in the theory of algorithms, FOS: Mathematics, stack sorting, Mathematics - Combinatorics, Combinatorics in computer science, Combinatorics (math.CO), 0102 computer and information sciences, 05A05 (primary), 68R05, 68W01 (secondary), 0101 mathematics, permutation, 01 natural sciences, sorting in series

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/pdf/math/0404176v1.pdf
http://arxiv.org/abs/math/0404176
https://zbmath.org/2121819
https://doi.org/10.1007/s00026-004-0209-3
https://link.springer.com/article/10.1007%2Fs00026-004-0209-3
https://core.ac.uk/display/2576756
https://link.springer.com/content/pdf/10.1007/s00026-004-0209-3.pdf

On the optimality of pseudo-polynomial algorithms for integer programming.

Autoren: Fomin, Fedor V. Panolan, Fahad Ramanujan, M. S. et al.

Quelle: Mathematical Programming. Mar2023, Vol. 198 Issue 1, p561-593. 33p.

Schlagwörter: *NONNEGATIVE matrices, *INTEGER programming, *COMPUTABLE functions, *ALGORITHMS

Moderate exponential-time algorithms for scheduling problems.

Autoren: T'kindt, Vincent Della Croce, Federico Liedloff, Mathieu

Quelle: Annals of Operations Research. Dec2024, Vol. 343 Issue 2, p753-783. 31p.

Schlagwörter: *TIME complexity, *ARTIFICIAL intelligence, *IMAGE processing, *ALGORITHMS, *MATHEMATICS

First- and second-order high probability complexity bounds for trust-region methods with noisy oracles.

Autoren: Cao, Liyuan Berahas, Albert S. Scheinberg, Katya

Quelle: Mathematical Programming; Sep2024, Vol. 207 Issue 1/2, p55-106, 52p

Schlagwörter: NOISE, PROBABILITY theory, ALGORITHMS, LITERATURE, DESIGN

Moderate exponential-time algorithms for scheduling problems.

Autoren: T'kindt, Vincent Della Croce, Federico Liedloff, Mathieu

Quelle: 4OR (1619-4500); Dec2022, Vol. 20 Issue 4, p533-566, 34p

KERNELIZATION OF GRAPH HAMILTONICITY: PROPER H-GRAPHS.

Autoren: CHAPLICK, STEVEN FOMIN, FEDOR V. GOLOVACH, PETR A. et al.

Quelle: SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 2, p840-892, 53p

Schlagwörter: NP-complete problems, POLYNOMIAL time algorithms, GRAPH connectivity, PARAMETERIZATION, TREE graphs, INTERSECTION graph theory, HAMILTONIAN graph theory

PERFECT Lp SAMPLING IN A DATA STREAM.

Autoren: JAYARAM, RAJESH WOODRUFF, DAVID

Quelle: SIAM Journal on Computing; 2021, Vol. 50 Issue 2, p382-439, 58p

Schlagwörter: RANDOM graphs, OPEN-ended questions

Geografische Kategorien: PHILADELPHIA (Pa.), THAILAND

EVOLUTIONARY TREES CAN BE LEARNED IN POLYNOMIAL TIME IN THE TWO-STATE GENERAL MARKOV MODEL.

Autoren: Cryan, Mary Goldberg, Leslie Ann Goldberg, Paul W.

Quelle: SIAM Journal on Computing; 2001, Vol. 31 Issue 2, p375, 23p

Schlagwörter: MARKOV processes, COMPUTATIONAL learning theory

BUSDM - an algorithm for the bottom-up search of departures from a model.

Autoren: Juutilainen, Ilmari Koskimaki, Heli Laurinen, Perttu et al.

Quelle: Journal of Statistical Computation & Simulation; May2011, Vol. 81 Issue 5, p561-578, 18p

Schlagwörter: REGRESSION analysis, ALGORITHMS, PREDICTION models, IRREGULARITIES of distribution (Number theory), MATHEMATICAL statistics, HYPERCUBES, ERROR analysis in mathematics

OUTER SYNCHRONIZATION OF DELAYED COUPLED SYSTEMS ON NETWORKS WITHOUT STRONG CONNECTEDNESS: A HIERARCHICAL METHOD.

Autoren: Liu, Shuang Li, Wenxue

Quelle: Discrete & Continuous Dynamical Systems - Series B; Mar2018, Vol. 23 Issue 2, p837-N.PAG, 23p

Schlagwörter: MATHEMATICAL connectedness, TIME delay systems, ALGORITHMS, LYAPUNOV functions, MATHEMATICS theorems

INFLUENCE ANALYSIS: A SURVEY OF THE STATE-OF-THE-ART.

Autoren: Han, Meng Li, Yingshu

Quelle: Mathematical Foundations of Computing; Aug2018, Vol. 1 Issue 3, p201-N.PAG, 53p

Schlagwörter: SOCIAL networks, SOCIAL network theory, SOCIAL groups, WIRELESS sensor networks, SOCIAL psychology

PHYSICAL LIMITS OF HEAT-BATH ALGORITHMIC COOLING.

Autoren: Schulman, Leonard J. Mor, Tal Weinstein, Yossi

Quelle: SIAM Journal on Computing; 2007, Vol. 36 Issue 6, p1729-1747, 19p

Schlagwörter: QUANTUM computers, ALGORITHMS, THERMODYNAMICS, QUANTUM theory, NUCLEAR magnetic resonance, ION traps, SYSTEMS design

FAST ALGORITHMS FOR FINDING PATTERN AVOIDERS AND COUNTING PATTERN OCCURRENCES IN PERMUTATIONS.

Autoren: KUSZMAUL, WILLIAM

Quelle: Mathematics of Computation; Mar2018, Vol. 87 Issue 310, p987-1011, 25p

Schlagwörter: PATTERN matching, PATTERNS (Mathematics), PATTERN perception, MACHINE translating, ALGORITHMS

On Computing the Measurable Amounts of the Two Jugs Problem.

Autoren: Man, Yiu-Kwong

Quelle: Mathematics in Computer Science; Dec2015, Vol. 9 Issue 4, p453-459, 7p

Envy-Free Division of Land.

Autoren: Segal-Halevi, Erel Nitzan, Shmuel Hassidim, Avinatan et al.

Quelle: Mathematics of Operations Research; Aug2020, Vol. 45 Issue 3, p896-922, 27p

Schlagwörter: INDIVIDUALS' preferences, GEOMETRIC shapes, DIGITAL media

RELAXATION-BASED COARSENING AND MULTISCALE GRAPH ORGANIZATION.

Quelle: Multiscale Modeling & Simulation; 2011, Vol. 9 Issue 1, p407-423, 17p

Schlagwörter: MULTISCALE modeling, GRAPH theory, PATHS & cycles in graph theory, COMBINATORIAL optimization, PARTITIONS (Mathematics), APPROXIMATION theory, SIMULATION methods & models

Optimal Cost Sharing for Resource Selection Games.

Autoren: von Falkenhausen, Philipp Harks, Tobias

Quelle: Mathematics of Operations Research; Feb2013, Vol. 38 Issue 1, p184-208, 25p, 4 Charts, 1 Graph

Schlagwörter: COST shifting, GAME theory, NASH equilibrium, MATROIDS, COMBINATORICS

Weighted games without a unique minimal representation in integers.

Autoren: Freixas, Josep Molinero, Xavier

Quelle: Optimization Methods & Software; Apr2010, Vol. 25 Issue 2, p203-215, 13p, 1 Diagram, 2 Charts

Schlagwörter: ALGORITHMS, LINEAR programming, VECTOR analysis, DYNAMIC programming, MATHEMATICAL optimization

Golomb-Lempel Construction of Costas Arrays Revisited.

Autoren: Barua, Ishani

Quelle: International Journal of Mathematics & Computer Science; 2015, Vol. 10 Issue 2, p239-249, 11p

Schlagwörter: PERMUTATIONS, COMBINATORIAL optimization, FINITE fields