1486 search results - page 139 / 298 » Algorithms for two-box covering |
118
Voted
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Fast spreading worms are a reality, as amply demonstrated by worms such as Slammer, which reached its peak propagation in a matter of minutes. With these kinds of fast spreadin...
134
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
133
click to vote
CSB
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents a novel algorithm for identification and functional characterization of “key” genome features responsible for a particular biochemical process of interest....
141
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
151
click to vote
I3E
2008
15 years 5 months ago
2008
Abstract. Many e-commerce sites use a recommendation system to filter the specific information that a user wants out of an overload of information. Currently, the usefulness of the...