Sciweavers

1763 search results - page 168 / 353
» Dependent random choice
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
13 years 12 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
ATAL
2006
Springer
13 years 12 months ago
Probabilistic policy reuse in a reinforcement learning agent
We contribute Policy Reuse as a technique to improve a reinforcement learning agent with guidance from past learned similar policies. Our method relies on using the past policies ...
Fernando Fernández, Manuela M. Veloso
ATAL
2006
Springer
13 years 12 months ago
Learning a common language through an emergent interaction topology
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...
Samarth Swarup, Kiran Lakkaraju, Les Gasser
FOCS
2004
IEEE
13 years 12 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
EUROCRYPT
2006
Springer
13 years 12 months ago
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Abstract. Lattice-based signature schemes following the GoldreichGoldwasser-Halevi (GGH) design have the unusual property that each signature leaks information on the signer's...
Phong Q. Nguyen, Oded Regev