An outer-approximation approach for information-maximizing sensor selection (Q1947624): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60022211, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-entropy remote sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving maximum-entropy sampling problems using factored masks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum lifetime coverage preserving scheduling algorithms in sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous trajectory planning of mobile sensors for informative forecasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of information systems. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile Sensor Network Control Using Mutual Information Methods and Particle Filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the largest eigenvalue in principal components analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Maximum Entropy Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Maximum-Entropy Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear integer programming bound for maximum-entropy sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming for Communication-Constrained Sensor Network Management / rank
 
Normal rank

Revision as of 08:59, 6 July 2024

scientific article
Language Label Description Also known as
English
An outer-approximation approach for information-maximizing sensor selection
scientific article

    Statements

    An outer-approximation approach for information-maximizing sensor selection (English)
    0 references
    0 references
    0 references
    0 references
    23 April 2013
    0 references
    sensor selection
    0 references
    outer-approximation algorithm
    0 references
    mutual information
    0 references
    maximum entropy sampling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers