Sciweavers

2168 search results - page 222 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ALT
2007
Springer
15 years 10 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
15 years 9 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
131
Voted
WSC
2007
15 years 6 months ago
Efficient suboptimal rare-event simulation
Much of the rare-event simulation literature is concerned with the development of asymptotically optimal algorithms. Because of the difficulties associated with applying these id...
Xiaowei Zhang, Jose Blanchet, Peter W. Glynn
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 10 months ago
Mean-Variance Optimization in Markov Decision Processes
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
Shie Mannor, John N. Tsitsiklis
131
Voted
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 9 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith