5169 search results - page 999 / 1034 » Locality approximation using time |
106
click to vote
ICCAD
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
136
click to vote
SC
2009
ACM
15 years 9 months ago
2009
ACM
Scientific workflow tools allow users to specify complex computational experiments and provide a good framework for robust science and engineering. Workflows consist of pipelines ...
106
Voted
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
124
click to vote
IWMM
2009
Springer
15 years 9 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
155
click to vote
HASKELL
2009
ACM
15 years 9 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...