Sciweavers

435 search results - page 36 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
97
Voted
GLOBECOM
2007
IEEE
14 years 9 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar
JAIR
2008
107views more  JAIR 2008»
14 years 9 months ago
Exploiting Subgraph Structure in Multi-Robot Path Planning
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
Malcolm Ross Kinsella Ryan
GECCO
2003
Springer
15 years 2 months ago
HEMO: A Sustainable Multi-objective Evolutionary Optimization Framework
The capability of multi-objective evolutionary algorithms (MOEAs) to handle premature convergence is critically important when applied to real-world problems. Their highly multi-mo...
Jianjun Hu, Kisung Seo, Zhun Fan, Ronald C. Rosenb...
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
15 years 2 months ago
On the Locality of Representations
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
Franz Rothlauf
VISUALIZATION
2003
IEEE
15 years 2 months ago
Feature Space Analysis of Unstructured Meshes
Unstructured meshes are often used in simulations and imaging applications. They provide advanced flexibility in modeling abilities but are more difficult to manipulate and anal...
Ariel Shamir