Sciweavers

2766 search results - page 307 / 554
» Algorithms for trigonometric polynomials
Sort
View
ANTSW
2010
Springer
15 years 3 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
COCOA
2010
Springer
15 years 3 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
136
Voted
IEEECGIV
2009
IEEE
15 years 2 months ago
Nonlinear Image Interpolation Using Adaptive Conic Blending Spline
Abstract--A new adaptive rational image interpolation algorithm is proposed. For a natural image, according to the difference information of the local pixel gray value in the verti...
Huanxi Zhao, Chuan Sun, Keshou Wu
TCS
2011
14 years 12 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...
JMLR
2010
115views more  JMLR 2010»
14 years 11 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto