Sciweavers

10106 search results - page 290 / 2022
» Algorithm Selection and Scheduling
Sort
View
TPDS
1998
76views more  TPDS 1998»
15 years 6 months ago
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
Sanguthevar Rajasekaran, Sartaj Sahni
CLUSTER
2008
IEEE
16 years 1 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
RTCSA
2003
IEEE
15 years 12 months ago
Scheduling Jobs with Multiple Feasible Intervals
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
Chi-Sheng Shih, Jane W.-S. Liu, Infan Kuok Cheong
IPPS
2010
IEEE
15 years 4 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
SGAI
2004
Springer
16 years 3 hour ago
Overfitting in Wrapper-Based Feature Subset Selection: The Harder You Try the Worse it Gets
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
John Loughrey, Padraig Cunningham