1568 search results - page 156 / 314 » The problem of examination questions in algorithmics |
140
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
139
click to vote
ICASSP
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— This work considers a combination classificationregression based framework with the proposal of using learned kernels in modified support vector regression to provide...
116
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
This paper attends to the problem of a mechanism designer seeking to influence the outcome of a strategic game based on her creditability. The mechanism designer offers additional...
145
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
— A heuristic is proposed to address free parameter selection for Support Vector Machines, with the goals of improving generalization performance and providing greater insensitiv...
144
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...