1632 search results - page 80 / 327 » Sublinear Time Algorithms for Metric Space Problems |
133
Voted
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We present the memetic climber, a simple search algorithm that learns topology and weights of neural networks on different time scales. When applied to the problem of learning ...
150
click to vote
CODES
2006
IEEE
15 years 9 months ago
2006
IEEE
Embedded system optimization typically considers objectives such as cost, timing, buffer sizes and power consumption. Robustness criteria, i.e. sensitivity of the system to variat...
143
Voted
DCG
2008
15 years 3 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
212
Voted
VLDB
2008
ACM
16 years 3 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
114
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...