1356 search results - page 55 / 272 » Some New Results on Inverse Sorting Problems |
CEC
2010
IEEE
13 years 10 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— There is growing interest in designing high speed routers with small buffers that store only tens of packets. Recent studies suggest that TCP NewReno, with the addition of a pa...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
The small sample size problem is often encountered in pattern recognition. It results in the singularity of the within-class scatter matrix Sw in Linear Discriminant Analysis (LDA...
MST
1998
13 years 9 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...