2714 search results - page 82 / 543 » Approximation Schemes for Scheduling |
88
Voted
TPDS
2002
15 years 5 days ago
2002
This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposit...
ICCD
2002
IEEE
15 years 9 months ago
2002
IEEE
VLIW processors are statically scheduled processors and their performance depends on the quality of the compiler’s scheduler. We propose a scheduling scheme where the applicatio...
93
Voted
FTDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters+md task cluster scheduling on distrib...
BIRTHDAY
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned versi...
112
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...