Sciweavers

4131 search results - page 583 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
COLT
2006
Springer
15 years 10 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
FASE
2006
Springer
15 years 10 months ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...
192
Voted
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 8 months ago
Context-dependent predictions and cognitive arm control with XCSF
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
Martin V. Butz, Oliver Herbort
ATAL
2010
Springer
15 years 7 months ago
Avoiding the prisoner's dilemma in auction-based negotiations for highly rugged utility spaces
There is a number of recent research lines addressing complex negotiations in highly rugged utility spaces. However, most of them focus on overcoming the problems imposed by the c...
Ivan Marsá-Maestre, Miguel A. López-...
217
Voted
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 7 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...