Sciweavers

7522 search results - page 1138 / 1505
» Spacing memetic algorithms
Sort
View
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
15 years 4 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson
PC
2002
137views Management» more  PC 2002»
15 years 4 months ago
The Chebyshev iteration revisited
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
Martin H. Gutknecht, Stefan Röllin
RAS
2002
129views more  RAS 2002»
15 years 4 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
SAC
2002
ACM
15 years 4 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
TNN
1998
146views more  TNN 1998»
15 years 4 months ago
An analytical framework for local feedforward networks
Interference in neural networks occurs when learning in one area of the input space causes unlearning in another area. Networks that are less susceptible to interference are refer...
S. Weaver, L. Baird, Marios M. Polycarpou
« Prev « First page 1138 / 1505 Last » Next »