The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
In this paper, we present an algorithm to combine edge information from stereo-derived depth maps with edges from the original intensity/color image to improve the contour detecti...
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...