Sciweavers

4103 search results - page 44 / 821
» Some results on the Collatz problem
Sort
View
JSAT
2006
114views more  JSAT 2006»
14 years 11 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
NCA
2008
IEEE
14 years 11 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
JSYML
2002
64views more  JSYML 2002»
14 years 11 months ago
Blowing up The Power Set of The Least Measurable
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...
Arthur W. Apter, James Cummings
INFSOF
1998
82views more  INFSOF 1998»
14 years 11 months ago
Teaching software engineering to a mixed audience
This paper describes some observations derived from teaching a course in software engineering to a mixed audience of undergraduates and professional Master's degree students ...
Michael W. Godfrey
EC
2008
153views ECommerce» more  EC 2008»
14 years 11 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev