|
99951 |
Solving 1D non-linear magneto quasi-static Maxwell's equations using neural networks
Baldan, Marco. - Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2021
|
|
|
|
99952 |
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
Harrach, Bastian von. - Frankfurt am Main : Universitätsbibliothek Johann Christian Senckenberg, 2021
|
|
|
|
99953 |
Solving high-dimensional dynamic portfolio choice models with hierarchical B-splines on sparse grids
Schober, Peter. - Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2021
|
|
|
|
99954 |
Solving mixed-integer nonlinear optimization problems using simultaneous convexification : a case study for gas networks
Liers, Frauke. - Magdeburg : Universitätsbibliothek Otto-von-Guericke-Universität, 2021
|
|
|
|
99955 |
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
Liers, Frauke. - Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2021
|
|
|
|
99956 |
Solving One Variable Word Equations in the Free Group in Cubic Time
Ferens, Robert. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99957 |
Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph
Gaul, Daniela. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99958 |
Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties
Johnn, Syu-Ning. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99959 |
Solving the Non-Crossing MAPF with CP
Peng, Xiao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
99960 |
Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks
Grafe, Vera. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
Administration
