Sciweavers

5331 search results - page 139 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICPR
2000
IEEE
15 years 11 months ago
Motion Segmentation Using Feature Selection and Subspace Method Based on Shape Space
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
Naoyuki Ichimura
CEC
2009
IEEE
15 years 4 months ago
Comparing parameter tuning methods for evolutionary algorithms
Abstract— Tuning the parameters of an evolutionary algorithm (EA) to a given problem at hand is essential for good algorithm performance. Optimizing parameter values is, however,...
Selmar K. Smit, A. E. Eiben
AIPS
2009
14 years 11 months ago
An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
Ruoyun Huang, Yixin Chen, Weixiong Zhang
TIT
2010
105views Education» more  TIT 2010»
14 years 4 months ago
Multigroup ML decodable collocated and distributed space-time block codes
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
G. Susinder Rajan, B. Sundar Rajan
HEURISTICS
2002
146views more  HEURISTICS 2002»
14 years 9 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...