Sciweavers

4324 search results - page 233 / 865
» A Generalized Representer Theorem
Sort
View
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
16 years 1 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
16 years 1 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
COLT
2004
Springer
15 years 12 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter
ISLPED
2003
ACM
85views Hardware» more  ISLPED 2003»
15 years 12 months ago
Low power coordination in wireless ad-hoc networks
Distributed wireless ad-hoc networks (DWANs) pose numerous technical challenges. Among them, two are widely considered as crucial: autonomous localized operation and minimization ...
Farinaz Koushanfar, Abhijit Davare, Dai Tho Nguyen...
GECCO
2003
Springer
108views Optimization» more  GECCO 2003»
15 years 11 months ago
Implicit Parallelism
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thu...
Alden H. Wright, Michael D. Vose, Jonathan E. Rowe