715 search results - page 126 / 143 » Neighborhood structures for genetic local search algorithms |
IJON
2010
13 years 5 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
JUCS
2006
13 years 8 months ago
2006
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
JMLR
2008
13 years 8 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
GECCO
2000
Springer
14 years 1 days ago
2000
Springer
This paper describes an evolutionary way to acquire behaviors of a mobile robot for recognizing environments. We have proposed AEM (Action-based Environment Modeling) approach for...