Sciweavers

1063 search results - page 21 / 213
» Programming Methodologies in GCLA
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Document reconstruction using dynamic programming
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
Andre Pimenta, Edson J. R. Justino, Luiz S. Olivei...
JELIA
2004
Springer
14 years 27 days ago
On the Relation Between ID-Logic and Answer Set Programming
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
Maarten Mariën, David Gilis, Marc Denecker
IEEEPACT
2003
IEEE
14 years 24 days ago
Redeeming IPC as a Performance Metric for Multithreaded Programs
Recent work has shown that multithreaded workloads running in execution-driven, full-system simulation environments cannot use instructions per cycle (IPC) as a valid performance ...
Kevin M. Lepak, Harold W. Cain, Mikko H. Lipasti
IPPS
2006
IEEE
14 years 1 months ago
Performance analysis of parallel programs via message-passing graph traversal
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...
Matthew J. Sottile, Vaddadi P. Chandu, David A. Ba...
VLSID
2004
IEEE
91views VLSI» more  VLSID 2004»
14 years 8 months ago
Program Slicing for ATPG-Based Property Checking
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
Vivekananda M. Vedula, Whitney J. Townsend, Jacob ...