Sciweavers

2877 search results - page 90 / 576
» The Complexity of Planarity Testing
Sort
View
COR
2008
122views more  COR 2008»
15 years 4 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
138
Voted
KBSE
2007
IEEE
15 years 10 months ago
Assertion-based repair of complex data structures
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
Bassem Elkarablieh, Ivan Garcia, Yuk Lai Suen, Sar...
BMCBI
2004
196views more  BMCBI 2004»
15 years 3 months ago
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
Robert C. Edgar
ICST
2009
IEEE
15 years 10 months ago
Inferring Types of References to GUI Objects in Test Scripts
Since manual black-box testing of GUI-based APplications (GAPs) is tedious and laborious, test engineers create test scripts to automate the testing process. These test scripts in...
Chen Fu, Mark Grechanik, Qing Xie
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
15 years 10 months ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener