5214 search results - page 204 / 1043 » The Online Specialization Problem |
138
click to vote
ACTA
1998
15 years 4 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
132
click to vote
TNN
2008
15 years 4 months ago
2008
In this paper, we propose a new supervised linear feature extraction technique for multiclass classification problems that is specially suited to the nearest neighbor classifier (N...
144
click to vote
SIBGRAPI
2005
IEEE
15 years 10 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
134
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
123
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...