|
171 |
A novel time series behavior matching algorithm for online conversion algorithms
Enthalten in Cluster computing 8.12.2017: 1-8
|
|
|
|
172 |
New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance
Enthalten in The journal of supercomputing 20.11.2017: 1-20
|
|
|
|
173 |
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms
Enthalten in Algorithmica 6.6.2017: 1-22
|
|
|
|
174 |
Control of force during rapid visuomotor force-matching tasks can be described by discrete time PID control algorithms
Enthalten in Experimental brain research 29.5.2017: 1-13
|
|
|
175 |
A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
Raghvendra, Sharath. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
176 |
Beating Ratio 0.5 for Weighted Oblivious Matching Problems
Abolhassani, Melika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
177 |
Bipartite Matching with Linear Edge Weights
Domanic, Nevzat Onur. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
178 |
Complexity and algorithms in matching problems under preferences
Cseh, Ágnes. - Berlin : Technische Universität Berlin, 2016
|
|
|
|
179 |
Coordination algorithms for supply and demand matching in future power networks
Badawy, Rashad. - Berlin : Technische Universität Berlin, 2016
|
|
|
|
180 |
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
Amir, Amihood. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
Administration
