Sciweavers

235 search results - page 30 / 47
» An empirical study into class testability
Sort
View
ICST
2008
IEEE
14 years 4 months ago
On the Predictability of Random Tests for Object-Oriented Software
Intuition suggests that random testing of object-oriented programs should exhibit a high difference in the number of defects detected by two different runs over the same amount of...
Ilinca Ciupa, Alexander Pretschner, Andreas Leitne...
TEC
2012
195views Formal Methods» more  TEC 2012»
12 years 2 days ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
SPAA
2009
ACM
14 years 10 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
METRICS
2003
IEEE
14 years 3 months ago
Estimating the Design Effort of Web Applications
Our study focuses on the effort needed for designing Web applications. The effort required for the design phase is an important part of the total development effort of a Web appli...
Luciano Baresi, Sandro Morasca, Paolo Paolini
CP
2003
Springer
14 years 2 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann