Sciweavers

376 search results - page 6 / 76
» On the Advice Complexity of Online Problems
Sort
View
72
Voted
ECBS
2005
IEEE
103views Hardware» more  ECBS 2005»
15 years 3 months ago
Improving the System/Software Engineering Interface for Complex System Development
At the 2004 Engineering of Computer Based Systems (ECBS) Technical Committee meeting, the ECBS Executive Committee agreed that a guideline on Integrated System and Software Engine...
Stephanie M. White
91
Voted
COLT
2006
Springer
15 years 1 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
ICML
2007
IEEE
15 years 10 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
ECOOP
2010
Springer
15 years 2 months ago
Essential AOP: The A Calculus
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
Bruno De Fraine, Erik Ernst, Mario Südholt
102
Voted
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 1 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber