Sciweavers

18209 search results - page 110 / 3642
» Some Remarks on the Paper
Sort
View
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
14 years 4 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 10 months ago
Stable Takens' Embeddings for Linear Dynamical Systems
Takens' Embedding Theorem remarkably established that concatenating M previous outputs of a dynamical system into a vector (called a delay coordinate map) can be a one-to-one...
Han Lun Yap, Christopher J. Rozell
NA
2010
82views more  NA 2010»
13 years 8 months ago
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
Matthew M. Lin, Bo Dong, Moody T. Chu
LICS
1991
IEEE
14 years 1 months ago
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
Hans Hüttel, Colin Stirling
COLT
2008
Springer
13 years 12 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...