Sciweavers

884 search results - page 66 / 177
» Control structures in programs and computational complexity
Sort
View
CC
2007
Springer
109views System Software» more  CC 2007»
14 years 1 months ago
Layout Transformations for Heap Objects Using Static Access Patterns
As the amount of data used by programs increases due to the growth of hardware storage capacity and computing power, efficient memory usage becomes a key factor for performance. Si...
Jinseong Jeon, Keoncheol Shin, Hwansoo Han
ICLP
1997
Springer
13 years 12 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CCE
2008
13 years 7 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
BIRTHDAY
2006
Springer
13 years 11 months ago
Data Flow Analysis for CCS
Data Flow Analysis as expressed by Monotone Frameworks is often associated with classical imperative programming languages and has played a crucial role in the efficient implementa...
Hanne Riis Nielson, Flemming Nielson
TCBB
2010
104views more  TCBB 2010»
13 years 6 months ago
Fast Hinge Detection Algorithms for Flexible Protein Structures
— Analysis of conformational changes is one of the keys to the understanding of protein functions and interactions. For the analysis, we often compare two protein structures, tak...
Tetsuo Shibuya