7380 search results - page 54 / 1476 » time 2008 |
ANOR
2008
13 years 10 months ago
2008
Abstract We consider the following scheduling setting: a set of
FORMATS
2008
Springer
13 years 11 months ago
2008
Springer
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
EUROPAR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We describe compiler and run-time optimisations for effective autoparallelisation of C++ programs on the Cell BE architecture. Auto-parallelisation is made easier by anno...
MANSCI
2008
13 years 10 months ago
2008
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
RIVF
2008
13 years 11 months ago
2008
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()