Sensor networks and distributed CSP: communication, computation and complexity (Q2457701): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098234648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage negotiation for distributed constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for standard benchmark domains in planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed arc-consistency algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301585 / rank
 
Normal rank

Latest revision as of 11:42, 27 June 2024

scientific article
Language Label Description Also known as
English
Sensor networks and distributed CSP: communication, computation and complexity
scientific article

    Statements

    Sensor networks and distributed CSP: communication, computation and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed CSP benchmark
    0 references
    phase transitions
    0 references
    randomized combinatorial search
    0 references
    communication network delays
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references