56 search results - page 5 / 12 » The test suite generation problem: Optimal instances and the... |
166
click to vote
EVOW
2007
Springer
16 years 23 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
189
click to vote
AAAI
2010
15 years 6 months ago
2010
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
225
click to vote
ANTSW
2004
Springer
16 years 16 hour ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
187
click to vote
FSTTCS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
206
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...