7522 search results - page 1197 / 1505 » Spacing memetic algorithms |
155
click to vote
TCS
2010
15 years 2 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
196
Voted
VLSISP
2010
15 years 2 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
164
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
The explosive increase of image data on Internet has made it an important, yet very challenging task to index and automatically annotate image data. To achieve that end, sophistic...
179
click to vote
AI
2011
Springer
14 years 11 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
142
Voted
JMLR
2011
14 years 11 months ago
2011
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...