4797 search results - page 94 / 960 » The complexity of partition tasks |
PPAM
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
JMLR
2006
13 years 9 months ago
2006
Abstract. We give dimension-free and data-dependent bounds for linear multi-task learning where a common linear operator is chosen to preprocess data for a vector of task speci...c...
RTAS
2010
IEEE
13 years 7 months ago
2010
IEEE
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...
JDA
2008
13 years 9 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...