Sciweavers

716 search results - page 13 / 144
» Algorithmic Issues in Coding Theory
Sort
View
SAC
2010
ACM
14 years 1 months ago
Reachability analysis of GSPDIs: theory, optimization, and implementation
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
Hallstein Asheim Hansen, Gerardo Schneider
SP
2010
IEEE
204views Security Privacy» more  SP 2010»
13 years 1 months ago
Acceleration of a CFD code with a GPU
The Computational Fluid Dynamics code Overflow includes as one of its solver options an algorithm which is a fairly small piece of code but which accounts for a significant portio...
Dennis C. Jespersen
INFSOF
2008
148views more  INFSOF 2008»
13 years 6 months ago
Translating unstructured workflow processes to readable BPEL: Theory and implementation
The Business Process Execution Language for Web Services (BPEL) has emerged as the de-facto standard for implementing processes. Although intended as a language for connecting web ...
Wil M. P. van der Aalst, Kristian Bisgaard Lassen
ICCV
2003
IEEE
14 years 8 months ago
Towards a Mathematical Theory of Primal Sketch and Sketchability
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
LCTRTS
1999
Springer
13 years 11 months ago
Optimizing for Reduced Code Space using Genetic Algorithms
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are designed to reduce the execution time of compiled cod...
Keith D. Cooper, Philip J. Schielke, Devika Subram...