Sciweavers

4103 search results - page 88 / 821
» Some results on the Collatz problem
Sort
View
CEC
2010
IEEE
15 years 7 months ago
A hybrid genetic algorithm and inver over approach for the travelling salesman problem
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
Shakeel Arshad, Shengxiang Yang
MVA
2008
201views Computer Vision» more  MVA 2008»
15 years 6 months ago
How close are we to solving the problem of automated visual surveillance?
The problem of automated visual surveillance has spawned a lively research area, with 2005 seeing three conferences or workshops and special issues of two major journals devoted to...
Hannah M. Dee, Sergio A. Velastin
SIAMSC
2008
145views more  SIAMSC 2008»
15 years 6 months ago
Fast Multilevel Algorithm for a Minimization Problem in Impulse Noise Removal
An effective 2-phase method for removing impulse noise was recently proposed. Its phase 1 identifies noisy pixel candidates by using median-type filters. Then in phase 2, it resto...
Raymond H. Chan, Ke Chen 0002
JUCS
2007
118views more  JUCS 2007»
15 years 6 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
UM
2007
Springer
16 years 17 days ago
Identifiability: A Fundamental Problem of Student Modeling
In this paper we show how model identifiability is an issue for student modeling: observed student performance corresponds to an infinite family of possible model parameter estimat...
Joseph E. Beck, Kai-min Chang