A feature commonality-based search strategy to find high \(t\)-wise covering solutions in feature models

DOI10.1007/s10601-023-09366-zzbMATH Open1539.68334MaRDI QIDQ6541863

Mathieu Vavrille

Publication date: 21 May 2024

Published in: Constraints (Search for Journal in Brave)

zbMATH Keywords

constraint programmingsearch strategyfeature model

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of software (68N99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal speedup of Las Vegas algorithms
• Solution sampling with random table constraints
• Practically uniform solution sampling in constraint programming
• An Efficient Method for Generating Discrete Random Variables with General Distributions
• Theory and Applications of Satisfiability Testing

This page was built for publication: A feature commonality-based search strategy to find high \(t\)-wise covering solutions in feature models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541863)