Sciweavers

50 search results - page 4 / 10
» Hausdorff Dimension in Exponential Time
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
Takekazu Kato, Toshikazu Wada
GECCO
2003
Springer
109views Optimization» more  GECCO 2003»
14 years 25 days ago
Real Royal Road Functions for Constant Population Size
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
Tobias Storch, Ingo Wegener
TCS
1998
13 years 7 months ago
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
Cristopher Moore
ICEC
1994
82views more  ICEC 1994»
13 years 9 months ago
Improving Search by Incorporating Evolution Principles in Parallel Tabu Search
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
Ivan De Falco, Renato Del Balio, Ernesto Tarantino...
JC
2008
77views more  JC 2008»
13 years 7 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...