948 search results - page 153 / 190 » What can we achieve by arbitrary announcements |
DATE
2003
IEEE
14 years 2 months ago
2003
IEEE
This paper presents an efficient methodology for estimating the energy consumption of application programs running on extensible processors. Extensible processors, which are incr...
ALGORITHMICA
2002
13 years 8 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
CGF
2004
13 years 8 months ago
2004
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
ICISC
2009
13 years 6 months ago
2009
Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplif...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
— Existing workflow systems attempt to achieve high performance by intelligently scheduling tasks on resources, sometimes even attempting to move the largest data files on the hi...