Sciweavers

2292 search results - page 288 / 459
» Techniques and tools for dynamic optimization
Sort
View
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
16 years 14 days ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
QEST
2007
IEEE
16 years 24 days ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
COMSWARE
2006
IEEE
16 years 17 days ago
Exploiting multi-channel clustering for power efficiency in sensor networks
Sensor networks typically comprise of a number of inexpensive small devices with processing, communication and sensing abilities that collaborate to perform a common task. Sensor d...
Ashima Gupta, Chao Gui, Prasant Mohapatra
SC
2005
ACM
16 years 2 days ago
Automatic Tuning of Inlining Heuristics
Inlining improves the performance of programs by reducing the overhead of method invocation and increasing the opportunities for compiler optimization. Incorrect inlining decision...
John Cavazos, Michael F. P. O'Boyle
ICSE
2005
IEEE-ACM
16 years 6 months ago
Binary refactoring: improving code behind the scenes
We present Binary Refactoring: a software engineering technique for improving the implementation of programs without modifying their source code. While related to regular refactor...
Eli Tilevich, Yannis Smaragdakis