7228 search results - page 30 / 1446 » From Algorithmic to Subjective Randomness |
78
Voted
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
KES
2010
Springer
14 years 8 months ago
2010
Springer
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
108
click to vote
SIAMCOMP
2012
13 years 2 days ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
112
Voted
ACMSE
2009
ACM
15 years 4 months ago
2009
ACM
This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by...