Sciweavers

2457 search results - page 110 / 492
» Local Search with Bootstrapping
Sort
View
IPCCC
2007
IEEE
15 years 4 months ago
Understanding Localized-Scanning Worms
— Localized scanning is a simple technique used by attackers to search for vulnerable hosts. Localized scanning trades off between the local and the global search of vulnerable h...
Zesheng Chen, Chao Chen, Chuanyi Ji
INFOCOM
2005
IEEE
15 years 3 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
BMCBI
2008
106views more  BMCBI 2008»
14 years 10 months ago
Searching for evolutionary distant RNA homologs within genomic sequences using partition function posterior probabilities
Background: Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases...
Usman Roshan, Satish Chikkagoudar, Dennis R. Lives...
LION
2009
Springer
203views Optimization» more  LION 2009»
15 years 4 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CEC
2008
IEEE
15 years 4 months ago
Memetic Gradient Search
—This paper reviews the different gradient-based schemes and the sources of gradient, their availability, precision and computational complexity, and explores the benefits of usi...
Boyang Li, Yew-Soon Ong, Minh Nghia Le, Chi Keong ...