Optimization problems in extension matrices

zbMATH Open0792.68146MaRDI QIDQ1201604FDOQ1201604

Authors: Xindong Wu 

Publication date: 17 January 1993

Published in: Science in China. Series A (Search for Journal in Brave)

Recommendations

• AE1: An extension matrix approximate method for the general covering problem
• Error-free and best-fit extensions of partially defined Boolean functions
• NEAREST NEIGHBOR PROBLEMS
• Learning optimization in simplifying fuzzy rules
• Inductive learning: A combinatorial optimization approach

zbMATH Keywords

optimizationpolynomial timeheuristic algorithmsinductive learningextension matrixNP-complexity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization Problems over Positive Pseudopolynomial Matrices
• Optimization problems involving matrix multiplication with applications in materials science and biology

This page was built for publication: Optimization problems in extension matrices

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