Sciweavers

5630 search results - page 289 / 1126
» Computability in Specification
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
How Algorithm Definition Language (ADL) improves the performance of SmartGridSolve applications
In this paper, we study the importance of languages for the specification of algorithms in high performance Grid computing. We present one such language, the Algorithm Definition ...
Michele Guidolin, Thomas Brady, Alexey L. Lastovet...
DAC
2005
ACM
15 years 8 months ago
Template-driven parasitic-aware optimization of analog integrated circuit layouts
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...
Sambuddha Bhattacharya, Nuttorn Jangkrajarng, C.-J...
ICS
2007
Tsinghua U.
16 years 28 days ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
ICFEM
2009
Springer
15 years 4 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
CVPR
2010
IEEE
16 years 3 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano