Sciweavers

97 search results - page 14 / 20
» Simple optimization techniques for A*-based search
Sort
View
IPCCC
2007
IEEE
14 years 1 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
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
On the runtime analysis of the 1-ANT ACO algorithm
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...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
DCC
2008
IEEE
14 years 1 months ago
A Novel Partial Prediction Algorithm for Fast 4x4 Intra Prediction Mode Decision in H.264/AVC
This paper proposes a partial prediction approach for fast mode decision in H.264/AVC 4x4 intra-prediction, exploiting the inherent symmetry existing in the spatial prediction mod...
Y. N. Sairam, Nan Ma, Neelu Sinha
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
14 years 29 days ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
PVLDB
2008
98views more  PVLDB 2008»
13 years 7 months ago
Performance profiling with EndoScope, an acquisitional software monitoring framework
We propose EndoScope, a software monitoring framework that allows users to pose declarative queries that monitor the state and performance of running programs. Unlike most existin...
Alvin Cheung, Samuel Madden