Sciweavers

4403 search results - page 284 / 881
» Galois Theory of Algorithms
Sort
View
CORR
2004
Springer
91views Education» more  CORR 2004»
15 years 6 months ago
Distributed Control by Lagrangian Steepest Descent
Often adaptive, distributed control can be viewed as an iterated game between independent players. The coupling between the players' mixed strategies, arising as the system ev...
David Wolpert, Stefan Bieniawski
IANDC
2010
105views more  IANDC 2010»
15 years 5 months ago
Symmetries, local names and dynamic (de)-allocation of names
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
Vincenzo Ciancia, Ugo Montanari
TOPLAS
2008
79views more  TOPLAS 2008»
15 years 5 months ago
Witnessing side effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alex Aiken
MA
2010
Springer
122views Communications» more  MA 2010»
15 years 5 months ago
Thresholding methods to estimate copula density
Abstract: This paper deals with the problem of multivariate copula density estimation. Using wavelet methods we provide two shrinkage procedures based on thresholding rules for whi...
F. Autin, E. Le Pennec, K. Tribouley
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 5 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani