725 search results - page 36 / 145 » Smoothed Analysis of Algorithms and Heuristics |
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
UIST
2006
ACM
15 years 3 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
111
click to vote
ACSAC
2007
IEEE
15 years 4 months ago
2007
IEEE
We present an extension of traditional "black box" fuzz testing using a genetic algorithm based upon a Dynamic Markov Model fitness heuristic. This heuristic allows us t...
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...