Showing 1 - 8 of 8
Computing a sample mean of time series under dynamic time warping is NP-hard. Consequently, there is an ongoing research effort to devise efficient heuristics. The majority of heuristics have been developed for the constrained sample mean problem that assumes a solution of predefined length. In...
Persistent link: https://www.econbiz.de/10015192814
other hand, popular heuristic approaches focusing on speed produce solutions of low quality. This paper presents an …
Persistent link: https://www.econbiz.de/10010896356
-convex constraints in this problem make it intractable using exact analytical approaches. Even via heuristic methods, the solution time …
Persistent link: https://www.econbiz.de/10010896454
been found. The heuristic makes no use of derivative information. We illustrate the approach on seven nonlinear equations …
Persistent link: https://www.econbiz.de/10010937780
Persistent link: https://www.econbiz.de/10009399896
Persistent link: https://www.econbiz.de/10008673931
black and W white vertices, such that there is no edge between a black and a white vertex. We suggest a heuristic, based on …
Persistent link: https://www.econbiz.de/10010600691
instances. For larger instances, a heuristic strategy is proposed, which relies on techniques for the generation of feasible …
Persistent link: https://www.econbiz.de/10015371288