Sciweavers

8486 search results - page 157 / 1698
» Ordered Enumeration Method
Sort
View
CEC
2008
IEEE
14 years 4 months ago
Methods for decreasing the number of objective evaluations for independent computationally expensive objective problems
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
Greg Rohling
COR
1999
99views more  COR 1999»
13 years 10 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß
ISCAS
2003
IEEE
139views Hardware» more  ISCAS 2003»
14 years 3 months ago
A subspace method for channel estimation of multi-user multi-antenna OFDM system
A subspace based blind method is proposed for estimating the channel responses of a multi-user and multi-antenna OFDM uplink system. It gives estimations to all channel responses,...
Yonghong Zeng, Tung-Sang Ng
ICASSP
2011
IEEE
13 years 2 months ago
A new variational method for preserving point-like and curve-like singularities in 2-D images
We propose a new variational method to restore point-like and curvelike singularities in 2-D images. As points and open curves are fine structures, they are difficult to restore...
Daniele Graziani, Laure Blanc-Féraud, Gille...
AAAI
1997
13 years 11 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan