Sciweavers

3544 search results - page 504 / 709
» Rethinking the Presentation of Results from Web Search
Sort
View
CEC
2008
IEEE
16 years 1 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
SCAM
2008
IEEE
16 years 27 days ago
Constructing Subtle Faults Using Higher Order Mutation Testing
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
Yue Jia, Mark Harman
ACSAC
2005
IEEE
16 years 4 days ago
Evolving Successful Stack Overflow Attacks for Vulnerability Testing
The work presented in this paper is intended to test crucial system services against stack overflow vulnerabilities. The focus of the test is the user-accessible variables, that i...
Hilmi Günes Kayacik, A. Nur Zincir-Heywood, M...
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
16 years 3 days ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng
MM
2003
ACM
113views Multimedia» more  MM 2003»
15 years 11 months ago
The combination limit in multimedia retrieval
Combining search results from multimedia sources is crucial for dealing with heterogeneous multimedia data, particularly in multimedia retrieval where a final ranked list of item...
Rong Yan, Alexander G. Hauptmann