Sciweavers

3825 search results - page 127 / 765
» Selective Value Prediction
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 4 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
2004
Springer
15 years 9 months ago
Modeling Selection Intensity for Toroidal Cellular Evolutionary Algorithms
We present quantitative models for the selection pressure of cellular evolutionary algorithms structured in two dimensional regular lattices. We derive models based on probabilisti...
Mario Giacobini, Enrique Alba, Andrea Tettamanzi, ...
DMIN
2006
122views Data Mining» more  DMIN 2006»
15 years 5 months ago
Class Selection Avoiding Key-like Property for Better Precise Rules
When we want to select a class attribute among several choices, we suggest to using a method that is based on the overall correctness of a generating rule set as well as the number...
Hyontai Sug
147
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...
ARITH
1999
IEEE
15 years 8 months ago
Boosting Very-High Radix Division with Prescaling and Selection by Rounding
An extension of the very-high radix division with prescaling and selection by rounding is presented. This extension consists in increasing the effective radix of the implementatio...
Paolo Montuschi, Tomás Lang