Sciweavers

815 search results - page 140 / 163
» Approximate Entropy Reducts
Sort
View
CEC
2010
IEEE
15 years 27 days ago
Local Optima Networks of the Quadratic Assignment Problem
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
Fabio Daolio, Sébastien Vérel, Gabri...
ANOR
2007
80views more  ANOR 2007»
14 years 12 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 12 months ago
Distributed Principal Component Analysis for Wireless Sensor Networks
Abstract: The Principal Component Analysis (PCA) is a data dimensionality reduction technique well-suited for processing data from sensor networks. It can be applied to tasks like ...
Yann-Aël Le Borgne, Sylvain Raybaud, Gianluca...
EAAI
2007
103views more  EAAI 2007»
14 years 11 months ago
Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
Ganesh K. Venayagamoorthy, Scott C. Smith, Gaurav ...
JFR
2006
88views more  JFR 2006»
14 years 11 months ago
Discovering natural kinds of robot sensory experiences in unstructured environments
We derive categories directly from robot sensor data to address the symbol grounding problem. Unlike model-based approaches where human intuitive correspondences are sought betwee...
Daniel H. Grollman, Odest Chadwicke Jenkins, Frank...