Sciweavers

1563 search results - page 132 / 313
» Performance comparison of memetic algorithms
Sort
View
122
Voted
ML
1998
ACM
102views Machine Learning» more  ML 1998»
15 years 3 months ago
Statistical Mechanics of Online Learning of Drifting Concepts: A Variational Approach
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
Renato Vicente, Osame Kinouchi, Nestor Caticha
154
Voted
PPSN
2010
Springer
15 years 1 months ago
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
Abel Garcia-Najera, John A. Bullinaria
118
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
CEC
2007
IEEE
15 years 10 months ago
Combine and compare evolutionary robotics and reinforcement Learning as methods of designing autonomous robots
—The purpose of this paper is to present a comparison between two methods of building adaptive controllers for robots. In spite of the wide range of techniques which are used for...
Sergiu Goschin, Eduard Franti, Monica Dascalu, San...
162
Voted
JMLR
2008
148views more  JMLR 2008»
15 years 3 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov