836 search results - page 48 / 168 » On the Complexity of Train Assignment Problems |
149
click to vote
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
166
click to vote
JSAC
2006
15 years 3 months ago
2006
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
160
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
129
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
153
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...