One way to contrast the behaviour of different algorithms in the field of timeseries forecasting is to compare the prediction error using a benchmark problem. Another interesting ...
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
In ultra-wideband (UWB) communications, the typical signal propagation through dense multipath fading offers potentially very large multipath diversity, but at the same time compl...
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...