Sciweavers

699 search results - page 117 / 140
» The method of combinatorial telescoping
Sort
View
GEOINFORMATICA
2002
136views more  GEOINFORMATICA 2002»
13 years 8 months ago
Tabu Search Heuristic for Point-Feature Cartographic Label Placement
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...
Missae Yamamoto, Gilberto Câmara, Luiz Anton...
GPEM
2002
163views more  GPEM 2002»
13 years 8 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
MOC
2002
131views more  MOC 2002»
13 years 8 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
TCS
1998
13 years 8 months ago
Merit Factors and Morse Sequences
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...
T. Downarowicz, Y. Lacroix
TEC
2002
133views more  TEC 2002»
13 years 8 months ago
Learning and optimization using the clonal selection principle
The clonal selection principle is used to explain the basic features of an adaptive immune response to an antigenic stimulus. It establishes the idea that only those cells that rec...
Leandro Nunes de Castro, Fernando J. Von Zuben