„Complex problems“

Suchergebnisse

2.217 Treffer

• A hybrid SA-MFO algorithm for function optimization and engineering design problems
  Sayed, Gehad Ismail ; Hassanien, Aboul Ella
• Parameterized Complexity of Superstring Problems
  Bliznets, Ivan ; Fomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S. ; Saurabh, Saket
• Current thermo-erosion dynamics of Ice Complex coasts in the Laptev Sea
  Günther, Frank ; Overduin, P. P. ; Sandakov, Aleksandr V. ; Grosse, Guido ; Baranskaya, Alisa ; Opel, Thomas ; Grigoriev, Mikhail N. 2013 Russian Academy of Sciences, Institute of Physicochemical and Biological Problems of Soil Science
• Different complex word problems require different combinations of cognitive skills
  Strohmaier, Anselm R. ; Reinhold, Frank ; Hofer, Sarah ; Berkowitz, Michal ; Vogel-Heuser, Birgit ; Reiss, Kristina
• On lower iteration complexity bounds for the convex concave saddle point problems
  Zhang, Junyu ; Hong, Mingyi ; Zhang, Shuzhong
• A fitness approximation assisted competitive swarm optimizer for large scale expensive optimization problems
  Sun, Chaoli ; Ding, Jinliang ; Zeng, Jianchao ; Jin, Yaochu
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
  Brucker, Peter ; Sotskov, Jurij Nazarovič ; Werner, Frank
• The Complexity of Knapsack Problems in Wreath Products
  Figelius, Michael ; Ganardi, Moses ; Lohrey, Markus ; Zetzsche, Georg 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Flexible Demands in Online Leasing Problems
  Li, Shouwei ; Markarian, Christine ; Meyer auf der Heide, Friedhelm
• Geometric Path Problems with Violations
  Maheshwari, Anil ; Nandy, Subhas C. ; Pattanayak, Drimit ; Roy, Sasanka ; Smid, Michiel
• Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
  Künnemann, Marvin ; Marx, Dániel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Many-Objective Multi-Verse Optimizer (MaOMVO): A Novel Algorithm for Solving Complex Many-Objective Engineering Problems
  Kalita, Kanak ; Jangir, Pradeep ; Pandya, Sundaram B. ; Shanmugasundar, G. ; Chohan, Jasgurpreet Singh ; Abualigah, Laith Mohammad Qasim
• Implementation of a Multidisciplinary Approach to Solve Complex Nano EHS Problems by the UC Center for the Environmental Implications of Nanotechnology
  Xia, Tian ; Malasarn, Davin ; Lin, Sijie ; Ji, Zhaoxia ; Zhang, Haiyuan ; Miller, Robert J. ; Keller, Arturo A. ; Nisbet, Roger M. ; Harthorn, Barbara H. ; Godwin, Hilary A. ; Lenihan, Hunter S. ; Liu, Rong ; Gardea‐Torresdey, Jorge ; Cohen, Yoram ; Mädler, Lutz ; Holden, Patricia A. ; Zink, Jeffrey I. ; Nel, Andre E.
• Local search methods for type I mixed-model two-sided assembly line balancing problems
  Li, Zixiang ; Janardhanan, Mukund Nilakantan ; Tang, Qiuhua ; Nielsen, Peter
• Complex wound-healing problems in neurosurgical patients: risk factors, grading and treatment strategy
  Krishnan, Kartik G. ; Müller, Adolf ; Hong, Bujung ; Potapov, Alexander A. ; Schackert, Gabriele ; Seifert, Volker ; Krauss, Joachim K.
• Inverse Problems for Semilinear Wave Equations on Lorentzian Manifolds
  Lassas, Matti ; Uhlmann, Gunther ; Wang, Yiran
• Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
  Boehmer, Niclas ; Heeger, Klaus ; Niedermeier, Rolf 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Counting (Dagstuhl Seminar 13031)
  Bürgisser, Peter ; Goldberg, Leslie Ann ; Jerrum, Mark ; Koiran, Pascal
• The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs
  Bellitto, Thomas ; Li, Shaohua ; Okrasa, Karolina ; Pilipczuk, Marcin ; Sorge, Manuel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity Dichotomy for Steiner Multicut
  Bringmann, Karl ; Hermelin, Danny ; Mnich, Matthias ; van Leeuwen, Erik Jan 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik