1568 search results - page 67 / 314 » The problem of examination questions in algorithmics |
98
Voted
SIGACT
2008
14 years 10 months ago
2008
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
ACSAC
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper we examine the problem of entering sensitive data, such as passwords, from an untrusted machine. By untrusted we mean that it is suspected to be infected with spywar...
74
Voted
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
60
Voted
ECCC
2006
14 years 10 months ago
2006
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
ENGL
2006
14 years 10 months ago
2006
Hybrid genetic algorithms have received significant interest in recent years and are being increasingly used to solve real-world problems. A genetic algorithm is able to incorporat...