Sciweavers

5506 search results - page 559 / 1102
» Minimal Logic Programs
Sort
View
PLDI
2009
ACM
16 years 1 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
SAGA
2009
Springer
16 years 1 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
16 years 7 days ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue
EDO
2006
Springer
15 years 10 months ago
Improving modularity of reflective middleware with aspect-oriented programming
Reflective middleware has been proposed as an effective way to enhance adaptability of component-oriented middleware architectures. To be effectively adaptable, the implementation...
Nélio Cacho, Thaís Vasconcelos Batis...
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 7 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...