Sciweavers

202 search results - page 9 / 41
» How Local Should a Learning Method Be
Sort
View
CEC
2005
IEEE
14 years 1 months ago
Adaptive local search parameters for real-coded memetic algorithms
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
Daniel Molina, Francisco Herrera, Manuel Lozano
NIPS
2004
13 years 8 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
PUK
2000
13 years 8 months ago
An Accessibility graph learning approach for task planning in large domains
Abstract. In the stream of research that aims to speed up practical planners, we propose a new approach to task planning based on Probabilistic Roadmap Methods (PRM). Our contribut...
Emmanuel Guere, Rachid Alami
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
13 years 11 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
CVPR
2010
IEEE
14 years 3 months ago
Learning a Hierarchy of Discriminative Space-Time Neighborhood Features for Human Action Recognition
Recent work shows how to use local spatio-temporal features to learn models of realistic human actions from video. However, existing methods typically rely on a predefined spatial...
Adriana Kovashka, Kristen Grauman