1542 search results - page 166 / 309 » Kernelization of packing problems |
125
click to vote
MP
2007
15 years 1 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
116
click to vote
MP
2010
15 years 5 days ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
122
click to vote
FPGA
1999
ACM
15 years 6 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
108
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
In this paper, we propose a probabilistic kernel approach to preference learning based on Gaussian processes. A new likelihood function is proposed to capture the preference relat...
104
click to vote
ISNN
2005
Springer
15 years 7 months ago
2005
Springer
In least squares support vector (LS-SVM), the key challenge lies in the selection of free parameters such as kernel parameters and tradeoff parameter. However, when a large number ...