3874 search results - page 756 / 775 » Approximation Algorithms for k-hurdle Problems |
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
PKDD
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. One solution to the lack of label problem is to exploit transfer learning, whereby one acquires knowledge from source-domains to improve the learning performance in the t...
130
click to vote
VLSISP
2010
14 years 8 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...
102
click to vote
ALGOSENSORS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...