„Complete Search“

Suchergebnisse

1.000+ Treffer

• A Simple Complete Search for Logic Programming
  Hemann, Jason ; Friedman, Daniel P. ; Byrd, William E. ; Might, Matthew 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Essential Western Novels - Volume 1
  Grey, Zane ; Cather, Willa ; Wister, Owen ; Adams, Andy ; Mulford, Clarence E. ; Nemo, August 2020 Tacet Books
• Search for high energy 5.5 MeV solar axions with the complete Borexino dataset
• Join optimization in distributed database systems based on a complete search space
  Langer, Uwe J. 1995 Univ., Presse- und Informationsstelle, Wiss.-Publizistik
• Search for high energy 5.5 MeV solar axions with the complete Borexino dataset
  Basilico, D. ; Bellini, G. ; Benziger, J. ; Biondi, R. ; Caccianiga, B. ; Calaprice, F. ; Caminata, A. ; Chepurnov, A. ; D’Angelo, D. ; Derbin, A. ; Di Giacinto, A. ; Di Marcello, V. ; Ding, X. F. ; Di Ludovico, A. ; Di Noto, L. ; Drachnev, I. ; Franco, D. ; Galbiati, C. ; Ghiano, C. ; Giammarchi, M. ; Goretti, A. ; Gromov, M. ; Guffanti, D. ; Ianni, Aldo ; Ianni, Andrea ; Jany, A. ; Kobychev, V. ; Korga, G. ; Kumaran, Sindhujha ; Laubenstein, M. ; Litvinovich, E. ; Lombardi, P. ; Lomskaya, I. ; Ludhova, Li 2025 Universitätsbibliothek der RWTH Aachen
• PLS-Completeness of String Permutations
  Scheder, Dominik ; Tantow, Johannes 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parallel MIP Solving with Dynamic Task Decomposition
  Lin, Peng ; Cai, Shaowei ; Zou, Mengchuan ; Chen, Shengqi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
  Bartoli, Daniele ; Davydov, Alexander A. ; Faina, Giorgio ; Kreshchuk, Alexey A. ; Marcugini, Stefano ; Pambianco, Fernanda
• Spanner Enumeration for Temporal Graphs
  Kurita, Kazuhiro ; Marino, Andrea ; Schoeters, Jason ; Uno, Takeaki 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity of Local Search for Euclidean Clustering Problems
  Manthey, Bodo ; Morawietz, Nils ; van Rhijn, Jesse ; Sommer, Frank 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Search for Interpulses in a Complete Sample of Pulsars at a Frequency of 111 MHz
  Toropov, M. O. ; Tyul’bashev, S. A. ; Beskin, V. S.
• PPP-Completeness and Extremal Combinatorics
  Bourneuf, Romain ; Folwarczný, Lukáš ; Hubáček, Pavel ; Rosen, Alon ; Schwartzbach, Nikolaj I. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard
  Komusiewicz, Christian ; Morawietz, Nils 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs
  Wang, Jie ; Chen, Dingding ; Chen, Ziyu ; Liu, Xiangshuang ; Gao, Junsong 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems
  Liu, Xiangshuang ; Chen, Ziyu ; Chen, Dingding ; Gao, Junsong 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Search Complexity of Discrete Logarithm
  Hubáček, Pavel ; Václavek, Jan 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Giving Wings to Your Career as a Flight Attendant – Everything You Ever Wanted to Know About Being a Cabin Crew Member
  Rabacher, Hans-Georg ; O'Donnell, Christine ; Welch, Carla ; Akobian, Liana 2023 Checkpilot
• Giving Wings to Your Career as a Flight Attendant – Everything You Ever Wanted to Know About Being a Cabin Crew Member
  Rabacher, Hans-Georg ; O'Donnell, Christine ; Welch, Carla ; Akobian, Liana 2023 Checkpilot
• Complete LEP data: Status of Higgs boson searches
  Sopczak, A.
• Efficient design of a complete rule search in sparsely populated search spaces
  Krause, Peter ; Krone, Angelika ; Slawinski, Timo 2004 Universitätsbibliothek Dortmund