7228 search results - page 83 / 1446 » From Algorithmic to Subjective Randomness |
114
Voted
DKE
2008
15 years 3 months ago
2008
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
153
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
103
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by sh...
173
click to vote
ASIACRYPT
2011
Springer
14 years 3 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
133
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...