Sciweavers

16404 search results - page 133 / 3281
» A set coverage problem
Sort
View
115
Voted
HASE
1998
IEEE
15 years 7 months ago
Estimating the Number of Residual Defects
Residual defects is one of the most important factors that allow one to decide if a piece of software is ready to be released. In theory, one can find all the defects and count th...
Yashwant K. Malaiya, Jason Denton
LPKR
1997
Springer
15 years 7 months ago
A System for Abductive Learning of Logic Programs
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
FTCS
1998
144views more  FTCS 1998»
15 years 4 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
15 years 10 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
FSTTCS
2009
Springer
15 years 10 months ago
A Fine-grained Analysis of a Simple Independent Set Algorithm
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
Joachim Kneis, Alexander Langer, Peter Rossmanith