Sciweavers

8695 search results - page 46 / 1739
» Making the Complex Simple
Sort
View
FPGA
2004
ACM
137views FPGA» more  FPGA 2004»
14 years 1 months ago
Making visible the thermal behaviour of embedded microprocessors on FPGAs: a progress report
This paper shows a method to verifying the thermal status of complex FPGA-based circuits like microprocessors. Thus, the designer can evaluate if a particular block is working bey...
Sergio López-Buedo, Eduardo I. Boemo
ECCC
2008
98views more  ECCC 2008»
13 years 8 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
CAIP
2007
Springer
125views Image Analysis» more  CAIP 2007»
14 years 1 days ago
Euclidean Shortest Paths in Simple Cube Curves at a Glance
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
Fajie Li, Reinhard Klette
CONCURRENCY
2006
92views more  CONCURRENCY 2006»
13 years 8 months ago
What makes workflows work in an opportunistic environment?
In this paper, we examine the issues of workflow mapping and execution in opportunistic environments such as the grid. As applications become ever more complex, the process of cho...
Ewa Deelman, Tevfik Kosar, Carl Kesselman, Miron L...
IEEECIT
2009
IEEE
13 years 5 months ago
Dynamic Adaptation of the Master-Worker Paradigm
Abstract--The size, heterogeneity and dynamism of the execution platforms of scientific applications, like computational grids, make using those platforms complex. Furthermore, tod...
Françoise André, Guillaume Gauvrit, ...