Sciweavers

452 search results - page 30 / 91
» Finding bugs is easy
Sort
View
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 3 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
DAGSTUHL
1994
14 years 11 months ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
66
Voted
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
15 years 1 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson
DIMVA
2009
14 years 10 months ago
A Case Study on Asprox Infection Dynamics
Abstract. The Asprox infection weaves a complex chain of dependencies involving bots that perform SQL injections on vulnerable web servers, and visitors whose machines get compromi...
Youngsang Shin, Steven A. Myers, Minaxi Gupta
ICSE
2008
IEEE-ACM
15 years 10 months ago
Precise memory leak detection for java software using container profiling
A memory leak in a Java program occurs when object references that are no longer needed are unnecessarily maintained. Such leaks are difficult to understand because static analyse...
Guoqing Xu, Atanas Rountev