„Dynamic optimality“

Suchergebnisse

91 Treffer

• A boundary control problem for the pure Cahn–Hilliard equation with dynamic boundary conditions
  Colli, Pierluigi ; Gilardi, Gianni ; Sprekels, Jürgen
• Guarding Offices with Maximum Dispersion
  Fekete, Sándor ; Kobbe, Kai ; Krupke, Dominik ; Mitchell, Joseph S. B. ; Rieck, Christian ; Scheffer, Christian 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimal Control: Novel Directions and Applications
  Tonon, Daniela ; Aronna, Maria Soledad ; Kalise, Dante 2017 Springer International Publishing
• Dynamics Analysis and Optimality in Selective Harvesting Predator-Prey Model With Modified Leslie-Gower and Holling-Type II
  Abid, W. ; Yafia, R. ; Aziz-Alaoui, M. A. ; Aghriche, Ahmed
• Industrial Mathematics and Complex Systems – Emerging Mathematical Models, Methods and Algorithms
  Manchanda, Pammy ; Lozi, René ; Siddiqi, Abul Hasan 2017 Springer Singapore
• Dynamic efficiency and Pareto optimality in a stochastic OLG model with produktion and social security
  Barbie, Martin ; Hagedorn, Marcus ; Kaul, Ashok 2000 IZA
• Necessary Optimality Conditions for Singular Controls of Caputo Fractional Systems with Delay in Control
  Yusubov, Shakir Sh ; Mahmudov, Elimhan N.
• The dynamics and revealed preference of status-quo optimality
  Vega-Redondo, Fernando
• The Group Access Bounds for Binary Search Trees
  Chalermsook, Parinya ; Gupta, Manoj ; Jiamjitrak, Wanchote ; Pareek, Akash ; Yingchareonthawornchai, Sorrachai 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Geometry of Tree-Based Sorting
  Blelloch, Guy E. ; Dobson, Magdalen 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm
  Sadeh, Yaniv ; Kaplan, Haim 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• What Does Dynamic Optimality Mean in External Memory?
  Bender, Michael A. ; Farach-Colton, Martín ; Kuszmaul, William 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Pinning down the Strong Wilber 1 Bound for Binary Search Trees
  Chalermsook, Parinya ; Chuzhoy, Julia ; Saranurak, Thatchaphol 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Settling the Relationship Between Wilber’s Bounds for Dynamic Optimality
  Lecomte, Victor ; Weinstein, Omri 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Multi-Finger Binary Search Trees
  Chalermsook, Parinya ; Goswami, Mayank ; Kozma, László ; Mehlhorn, Kurt ; Saranurak, Thatchaphol 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Merging optimality conditions with genetic algorithm operators to solve single machine total weighted tardiness problem
  Al-Harkan, Ibrahim M.
• On the dynamic optimality of yardstick regulation
  Bisceglia, Michele ; Cellini, Roberto ; Grilli, Luca
• Asymptotic limits and optimal control for the Cahn-Hilliard system with convection and dynamic boundary conditions
  Gilardi, Gianni ; Sprekels, Jürgen 2018 Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik
• On the optimality of limit cycles in dynamic economic systems
  Dockner, Engelbert J. ; Feichtinger, Gustav
• Dynamic Programming and Mean-Variance Hedging in Discrete Time
  Gugushvili, S.