1170 search results - page 194 / 234 » How Fast Is Too Fast |
122
Voted
CP
2011
Springer
14 years 2 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
138
Voted
ICC
2011
IEEE
14 years 2 months ago
2011
IEEE
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
129
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—Intrusion Detection Systems (IDS) have become ubiquitous in the defense against virus outbreaks, malicious exploits of OS vulnerabilities, and botnet proliferation. As attackers...
110
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
119
click to vote
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...