Sciweavers

2613 search results - page 107 / 523
» On an Optimization Problem in Sensor Selection*
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
14 years 10 months ago
Convex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 3 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
15 years 1 months ago
Multiobjective genetic rule selection as a data mining postprocessing procedure
In this paper, we show the usefulness of multiobjective genetic rule selection as a postprocessing procedure in data mining for pattern classification problems. First we extract a...
Hisao Ishibuchi, Yusuke Nojima, Isao Kuwajima
EOR
2006
97views more  EOR 2006»
14 years 9 months ago
Bayesian portfolio selection with multi-variate random variance models
We consider multi-period portfolio selection problems for a decision maker with a specified utility function when the variance of security returns is described by a discrete time ...
Refik Soyer, Kadir Tanyeri
DMSN
2009
ACM
15 years 4 months ago
Validated cost models for sensor network queries
Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...