Sciweavers

342 search results - page 37 / 69
» Constrained Integer Partitions
Sort
View
ISSRE
2003
IEEE
15 years 3 months ago
A New Software Testing Approach Based on Domain Analysis of Specifications and Programs
Partition testing is a well-known software testing technique. This paper shows that partition testing strategies are relatively ineffective in detecting faults related to small sh...
Ruilian Zhao, Michael R. Lyu, Yinghua Min
EUROPAR
2005
Springer
15 years 3 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 4 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
INFORMS
2008
55views more  INFORMS 2008»
14 years 9 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
CJCDGCGT
2005
Springer
14 years 11 months ago
Fractional Vertex Arboricity of Graphs
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
Qinglin Yu, Lian-Cui Zuo