Sciweavers

159 search results - page 26 / 32
» Program COmprehension through Dynamic Analysis
Sort
View
CDC
2008
IEEE
236views Control Systems» more  CDC 2008»
14 years 2 months ago
Non-monotonic Lyapunov functions for stability of discrete time nonlinear and switched systems
Abstract— We relax the monotonicity requirement of Lyapunov’s theorem to enlarge the class of functions that can provide certificates of stability. To this end, we propose two...
Amir Ali Ahmadi, Pablo A. Parrilo
SAC
1996
ACM
13 years 11 months ago
An enabling optimization for C++ virtual functions
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
Bradley M. Kuhn, David Binkley
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
14 years 1 months ago
Constant generation for the financial domain using grammatical evolution
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
Ian Dempsey
MICRO
2000
IEEE
137views Hardware» more  MICRO 2000»
14 years 13 hour ago
Relational profiling: enabling thread-level parallelism in virtual machines
Virtual machine service threads can perform many tasks in parallel with program execution such as garbage collection, dynamic compilation, and profile collection and analysis. Har...
Timothy H. Heil, James E. Smith
SOCA
2008
IEEE
13 years 7 months ago
Log-based mining techniques applied to Web service composition reengineering
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
Walid Gaaloul, Karim Baïna, Claude Godart