Sciweavers

7978 search results - page 38 / 1596
» Combining shared-coin algorithms
Sort
View
EVOW
2011
Springer
14 years 2 months ago
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
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...
Arpad Rimmel, Fabien Teytaud, Tristan Cazenave
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
14 years 8 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
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...
Haider Fakher Radhi Al-Saidy
JDA
2010
122views more  JDA 2010»
14 years 6 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
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...
Ignasi Sau, Dimitrios M. Thilikos
3DPVT
2004
IEEE
15 years 3 months ago
Recognition of Object Contours from Stereo Images: An Edge Combination Approach
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...
Margrit Gelautz, Danijela Markovic
ANTSW
2008
Springer
15 years 11 days ago
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
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...
Frank Neumann, Dirk Sudholt, Carsten Witt