For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...
Zijiang Yang, Chao Wang, Aarti Gupta, Franjo Ivanc...
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...