Sciweavers

4103 search results - page 107 / 821
» Some results on the Collatz problem
Sort
View
AUSAI
2005
Springer
15 years 8 months ago
Understanding the Pheromone System Within Ant Colony Optimization
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
Stephen Gilmour, Mark Dras
MOC
2000
126views more  MOC 2000»
15 years 6 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion
JCO
2010
90views more  JCO 2010»
15 years 5 months ago
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a dz-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s −1),s ...
Geng-sheng Zhang, Yu-qin Yang
ICIP
2009
IEEE
15 years 4 months ago
Gamut fitting for image composition applications
Existing digital image composition algorithms neglect the out-of-gamut problem, i.e. some pixel values in a composited image exceed the displayable or printable range. In this pap...
Wenxian Yang, Jianmin Zheng, Jianfei Cai
MST
2007
167views more  MST 2007»
15 years 6 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...