Sciweavers

1994 search results - page 59 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
A simulator for parallel applications with dynamically varying compute node allocation
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
Basile Schaeli, B. Gerlach, Roger D. Hersch
CIB
2004
83views more  CIB 2004»
14 years 9 months ago
Web-Based Semantic Pervasive Computing Services
Abstract-- Pervasive Computing refers to a seamless and invisible computing environment which provides dynamic, proactive and context-aware services to the user by acquiring contex...
Yugyung Lee, Soon Ae Chun, James Geller
SC
2005
ACM
15 years 3 months ago
Using Dynamic Tracing Sampling to Measure Long Running Programs
Ø Ð × ÑÙÐ Ø ÓÒ Ò Ù× ÙÐ ØÓ ÓØ ×Ýר Ñ ¹ Ú ÐÓÔ Ö× Ò ÔÔÐ Ø ÓÒ ÛÖ Ø Ö× ØÓ ÙÒ Öר Ò Ò ÔÔÐ ¹ Ø ÓÒ³× Ô Ö ÓÖÑ Ò º ÀÓÛ ...
Jeffrey Odom, Jeffrey K. Hollingsworth, Luiz De Ro...
WCET
2008
14 years 11 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
ICFP
2003
ACM
15 years 9 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano