From eager or lazy constrained data acquisition: A general framework

DOI10.1007/BF03037573MaRDI QIDQ5952497zbMATH OpenFDO

Authors Paola Mello, Michela Milano, Marco Gavanelli, Evelina Lamma, Massimo Piccardi, Rita Cucchiara

Publication date 22 October 2002

Published in New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

constraint satisfaction problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Efficient multiple constraint acquisition
• The characterization of data-accumulating algorithms
• Algorithmic Aspects of Wireless Sensor Networks
• Constrained Optimal Input Signal Design for Data-Centric Estimation Methods

Cites work

• scientific article; zbMATH DE number 4174376 (Why is no real title available?)
• scientific article; zbMATH DE number 4162324 (Why is no real title available?)
• scientific article; zbMATH DE number 3909708 (Why is no real title available?)
• scientific article; zbMATH DE number 1497830 (Why is no real title available?)
• scientific article; zbMATH DE number 830949 (Why is no real title available?)
• Truly concurrent constraint programming

Cited in

(3)

• A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs
• Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
• Efficient multiple constraint acquisition

Describes a project that uses

Uses Software

• Oz
• Mozart
• CHIP

This page was built for publication: From eager or lazy constrained data acquisition: A general framework

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