Sciweavers

32 search results - page 2 / 7
» A machine code model for efficient advice dispatch
Sort
View
COLT
2004
Springer
13 years 9 months ago
Minimizing Regret with Label Efficient Prediction
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
AOSD
2004
ACM
13 years 11 months ago
Virtual machine support for dynamic join points
A widespread implementation approach for the join point mechanism of aspect-oriented languages is to instrument areas in code that match the static part of pointcut designators, i...
Christoph Bockisch, Michael Haupt, Mira Mezini, Kl...
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
13 years 9 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng
COLT
2006
Springer
13 years 9 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
GPCE
2009
Springer
13 years 10 months ago
Advanced runtime adaptation for Java
Dynamic aspect-oriented programming (AOP) enables runtime adaptation of aspects, which is important for building sophisticated, aspect-based software engineering tools, such as ad...
Alex Villazón, Walter Binder, Danilo Ansalo...