151 search results - page 16 / 31 » Constraint Satisfiability Algorithms for Interactive Student... |
ICA3PP
2010
Springer
14 years 10 days ago
2010
Springer
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
ISSS
2002
IEEE
14 years 14 days ago
2002
IEEE
This paper addresses the problem of mapping an application, which is highly dynamic in the future, onto a heterogeneous multiprocessor platform in an energy efficient way. A two-p...
GRID
2006
Springer
13 years 7 months ago
2006
Springer
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
TCAD
1998
13 years 7 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
ISAAC
2001
Springer
13 years 12 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...