Výsledky vyhľadávania - "dynamic algorithm"

  1. 1

    Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing Autor Bernstein, Aaron, Gutenberg, Maximilian Probst, Saranurak, Thatchaphol

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 01.11.2020
    “…Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge deletions…”
    Získať plný text
    Konferenčný príspevok..
  2. 2

    On Finding Optimal (Dynamic) Arborescences Autor Espada, Joaquim, Francisco, Alexandre P., Rocher, Tatiana, Russo, Luís M. S., Vaz, Cátia

    ISSN: 1999-4893, 1999-4893
    Vydavateľské údaje: Basel MDPI AG 01.12.2023
    Vydané v Algorithms (01.12.2023)
    “…, an optimal arborescence. Furthermore, when G is subject to changes, namely, edge insertions and deletions, we are interested in efficiently maintaining a dynamic arborescence in G…”
    Získať plný text
    Journal Article
  3. 3

    A Fully Dynamic Algorithm for Planar Width Autor Chan, Timothy M.

    ISSN: 0179-5376, 1432-0444
    Vydavateľské údaje: New York Springer Nature B.V 01.07.2003
    Vydané v Discrete & computational geometry (01.07.2003)
    “…) amortized time per update. Previously, no fully dynamic algorithm with a guaranteed sublinear time bound was known…”
    Získať plný text
    Journal Article
  4. 4

    A Dynamic Algorithm for Weighted Submodular Cover Problem Autor Banihashem, Kiarash, Goudarzi, Samira, Hajiaghayi, MohammadTaghi, Jabbarzade, Peyman, Monemizadeh, Morteza

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 13.07.2024
    Vydané v arXiv.org (13.07.2024)
    “… \(S \subseteq V\) that minimizes the cost subject to the constraint \(f(S) = f(V)\). This is a classical problem in computer science and generalizes the Set Cover problem, 2-Set Cover, and dominating set problem among others…”
    Získať plný text
    Paper
  5. 5

    Fully Dynamic Evaluation of Sequence Pair Autor Kozik, A.

    ISSN: 0278-0070, 1937-4151
    Vydavateľské údaje: IEEE 01.06.2013
    “… In this paper, motivated by the significance of the sequence pair (SP) representation for floorplanning, we develop a fully dynamic algorithm of SP evaluation…”
    Získať plný text
    Journal Article
  6. 6

    An improved spiral dynamic algorithm and its application to fuzzy modelling of a twin rotor system Autor Nasir, A. N. K., Tokhi, M. O., Omar, M. E., Ghani, N. M. A.

    ISBN: 9781479928057, 1479928054
    Vydavateľské údaje: IEEE 01.01.2014
    “… Spiral motion and dynamic step size generated by a spiral model produce unique exploration and exploitation strategies of a spiral dynamic algorithm…”
    Získať plný text
    Konferenčný príspevok..
  7. 7

    Dynamic demand-side management with user's privacy concern in residential community Autor Hsin-Hui Kuo, Pradhan, Sipun Kr, Chao-Lin Wu, Pei-Hsuan Cheng, Yifei Xie, Li-Chen Fu

    ISSN: 2161-8089
    Vydavateľské údaje: IEEE 01.08.2016
    “…) of utility of a community of customers subject to real-time pricing (RTP) policy. Moreover, a good DSM system should also be able to react quickly when users do not take its advice or when the environment state changes…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

    Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs Autor Behnezhad, Soheil, Ghafari, Alma

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 27.10.2024
    “…We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is subject to edge insertions and deletions…”
    Získať plný text
    Konferenčný príspevok..
  9. 9

    On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability Autor Krishna, Shankaranarayanan, Lal, Aniket, Pavlogiannis, Andreas, Tuppe, Omkar

    ISSN: 2475-1421, 2475-1421
    Vydavateľské údaje: New York, NY, USA ACM 02.01.2024
    “… In the everyday practice of program analysis, the analyzed code is subject to continuous change, with source code being added and removed…”
    Získať plný text
    Journal Article
  10. 10

    A Lossless Deamortization for Dynamic Greedy Set Cover Autor Solomon, Shay, Uzrad, Amitai, Zhang, Tianyi

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 27.10.2024
    “…The dynamic set cover problem has been subject to growing research attention in recent years…”
    Získať plný text
    Konferenčný príspevok..
  11. 11

    Fully dynamic update of arc-flags Autor D'Angelo, Gianlorenzo, D'Emidio, Mattia, Frigioni, Daniele

    ISSN: 0028-3045, 1097-0037
    Vydavateľské údaje: Hoboken, NJ Blackwell Publishing Ltd 01.05.2014
    Vydané v Networks (01.05.2014)
    “…Best connections in real networks are usually found by applying Dijkstra's shortest paths algorithm. Unfortunately, networks deriving from real‐world…”
    Získať plný text
    Journal Article
  12. 12

    Fully Dynamic Algorithms for Euclidean Steiner Tree Autor T-H, Hubert Chan, Goranci, Gramoz, Jiang, Shaofeng H -C, Wang, Bo, Xue, Quan

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 30.11.2023
    Vydané v arXiv.org (30.11.2023)
    “…)\)-approximation was obtained in the offline setting in seminal works of Arora and Mitchell, efficient dynamic algorithms for Steiner tree is still open…”
    Získať plný text
    Paper
  13. 13

    Predicting 3-D Lower Back Joint Load in Lifting: A Deep Pose Estimation Approach Autor Mehrizi, Rahil, Peng, Xi, Metaxas, Dimitris N., Xu, Xu, Zhang, Shaoting, Li, Kang

    ISSN: 2168-2291, 2168-2305
    Vydavateľské údaje: New York IEEE 01.02.2019
    “…Goal: Lifting is a common manual material handling task performed in the workplaces. It is considered as one of the main risk factors for work-related…”
    Získať plný text
    Journal Article
  14. 14

    Dynamic Euclidean bottleneck matching Autor Abu-Affash, A. Karim, Bhore, Sujoy, Carmi, Paz

    ISSN: 0304-3975
    Vydavateľské údaje: Elsevier B.V 24.10.2024
    Vydané v Theoretical computer science (24.10.2024)
    “… For a set P of n points on a line, we show that there exists a dynamic algorithm that maintains an exact bottleneck matching of P and supports…”
    Získať plný text
    Journal Article
  15. 15

    Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part II Autor Fisman, Dana, Rosu, Grigore

    ISBN: 3030995275, 9783030995270, 9783030995263, 3030995267
    Vydavateľské údaje: Cham Springer Nature 2022
    “…This open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems,…”
    Získať plný text
    E-kniha
  16. 16

    Improved Dynamic Algorithms for Longest Increasing Subsequence Autor Kociumaka, Tomasz, Seddighin, Saeed

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 09.03.2021
    Vydané v arXiv.org (09.03.2021)
    “…We study dynamic algorithms for the longest increasing subsequence (\textsf{LIS}) problem. A dynamic \textsf{LIS} algorithm maintains a sequence subject to operations of the following form arriving one by one…”
    Získať plný text
    Paper
  17. 17

    Dynamic algorithms for classes of constraint satisfaction problems Autor Frigioni, Daniele, Marchetti-Spaccamela, Alberto, Nanni, Umberto

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Amsterdam Elsevier B.V 28.05.2001
    Vydané v Theoretical computer science (28.05.2001)
    “…). It is the problem of finding an assignment of values for a set of variables, each defined on a finite domain of feasible values, subject to a given collection of constraints…”
    Získať plný text
    Journal Article
  18. 18

    Cost-Minimizing Dynamic Migration of Content Distribution Services into Hybrid Clouds Autor Xuanjia Qiu, Hongxing Li, Chuan Wu, Zongpeng Li, Lau, Francis C. M.

    ISSN: 1045-9219, 1558-2183
    Vydavateľské údaje: New York IEEE 01.12.2015
    “…With the recent advent of cloud computing technologies, a growing number of content distribution applications are contemplating a switch to cloud-based…”
    Získať plný text
    Journal Article
  19. 19

    Dynamic prediction of metastases after radical prostatectomy for prostate cancer Autor Inman, Brant A., Frank, Igor, Boorjian, Stephen A., Akornor, Joseph W., Karnes, R. Jeffrey, Leibovich, Bradley C., Blute, Michael L., Bergstralh, Eric J.

    ISSN: 1464-4096, 1464-410X, 1464-410X
    Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.12.2011
    Vydané v BJU international (01.12.2011)
    “…Study Type – Prognosis (retrospective cohort) Level of Evidence 2a What’s known on the subject…”
    Získať plný text
    Journal Article
  20. 20

    Structural Fault Diagnosis Based on Static and Dynamic Response Parameters Autor Yang, Qiuwei, Qin, Fengjiang, Peng, Xi

    ISSN: 2079-6412, 2079-6412
    Vydavateľské údaje: Basel MDPI AG 14.05.2023
    Vydané v Coatings (Basel) (14.05.2023)
    “…Structural fault diagnosis is an important subject for ensuring the normal use of structures…”
    Získať plný text
    Journal Article