Sciweavers

1529 search results - page 190 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
DAC
2001
ACM
16 years 5 months ago
MetaCores: Design and Optimization Techniques
Currently, hardware intellectual property (IP) is delivered at vels of abstraction: hard, firm, and soft. In order to further enhance performance, efficiency, and flexibility of I...
Seapahn Meguerdichian, Farinaz Koushanfar, Advait ...
129
Voted
ICIC
2005
Springer
15 years 9 months ago
A Sequential Niching Technique for Particle Swarm Optimization
This paper proposed a modified algorithm, sequential niching particle swarm optimization (SNPSO), for the attempt to get multiple maxima of multimodal function. Based on the sequen...
Jun Zhang, Jing-Ru Zhang, Kang Li
CSDA
2008
98views more  CSDA 2008»
15 years 4 months ago
Forecasting binary longitudinal data by a functional PC-ARIMA model
The purpose of this paper is to forecast the time evolution of a binary response variable from an associated continuous time series observed only at discrete time points that usual...
Ana M. Aguilera, Manuel Escabias, Mariano J. Valde...
CEC
2005
IEEE
15 years 9 months ago
Dynamic niching in evolution strategies with covariance matrix adaptation
Abstract- Evolutionary Algorithms (EAs) have the tendency to converge quickly into a single solution in the search space. However, many complex search problems require the identiï¬...
Ofer M. Shir, Thomas Bäck
129
Voted
ICLP
1999
Springer
15 years 8 months ago
Comparing Trailing and Copying for Constraint Programming
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
Christian Schulte