Sciweavers

478 search results - page 21 / 96
» Improving probability bounds by optimization over subsets
Sort
View
MP
2008
99views more  MP 2008»
13 years 7 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
AIA
2007
13 years 9 months ago
Improving the aggregating algorithm for regression
Kernel Ridge Regression (KRR) and the recently developed Kernel Aggregating Algorithm for Regression (KAAR) are regression methods based on Least Squares. KAAR has theoretical adv...
Steven Busuttil, Yuri Kalnishkan, Alexander Gammer...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 2 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
ICC
2007
IEEE
162views Communications» more  ICC 2007»
14 years 1 months ago
Application of Signal Space Diversity in BICM-ID over Cascaded Rayleigh Fading Channels
— Exploiting signal space diversity (SSD) to improve the error performance of communications systems over fading channels has been shown to be a very effective technique. The app...
Nghi H. Tran, Ha H. Nguyen, Tho Le-Ngoc
FOGA
2011
12 years 11 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe