Sciweavers

8647 search results - page 608 / 1730
» The Container Selection Problem
Sort
View
ICDE
2010
IEEE
238views Database» more  ICDE 2010»
16 years 2 months ago
Correlation hiding by independence masking
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
Yufei Tao, Jian Pei, Jiexing Li, Xiaokui Xiao, Ke ...
ICDM
2007
IEEE
97views Data Mining» more  ICDM 2007»
16 years 1 months ago
Supervised Learning by Training on Aggregate Outputs
Supervised learning is a classic data mining problem where one wishes to be be able to predict an output value associated with a particular input vector. We present a new twist on...
David R. Musicant, Janara M. Christensen, Jamie F....
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
16 years 1 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
16 years 20 days ago
Learning, anticipation and time-deception in evolutionary online dynamic optimization
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
Peter A. N. Bosman
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
16 years 13 days ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...