Sciweavers

1071 search results - page 20 / 215
» Programming with enumerable sets of structures
Sort
View
ISSRE
2003
IEEE
14 years 4 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
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 2 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
BMCBI
2006
107views more  BMCBI 2006»
13 years 11 months ago
Analysis of optimal phenotypic space using elementary modes as applied to Corynebacterium glutamicum
Background: Quantification of the metabolic network of an organism offers insights into possible ways of developing mutant strain for better productivity of an extracellular metab...
Kalyan Gayen, K. V. Venkatesh
ICTAI
2006
IEEE
14 years 5 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...
IPCO
2007
126views Optimization» more  IPCO 2007»
14 years 10 days ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...