Multi-ordered distributed constraint search

作者: Youssef Hamadi , Georg Ringwelski

DOI:

关键词:

摘要: A node participating in a network of nodes that solve distributed constraint problem. The have mutually constrained sub-problems the receives values or decisions from neighbor nodes. Those allow to be solved. Some received correspond first ordering nodes, and some second Attempts are made sub-problem as by Results attempts communicated where for given value decision which corresponding attempt result is depends on orderings corresponds to. An one context can affected another context.

参考文章(29)
Brandon Brockway, Gregory Wayne Roberts, Tiffany Brooke Durham, Cheryl Louise Malatras, Semantics-based searching for information in a distributed data processing system ,(2003)
Lingzhong Zhou, John Thornton, Abdul Sattar, Dynamic agent ordering in distributed constraint satisfaction problems australasian joint conference on artificial intelligence. pp. 427- 439 ,(2003) , 10.1007/978-3-540-24581-0_36
Markus P. J. Fromherz, Warren B. Jackson, Adaptive constraint problem solving method and system ,(2001)
Lawrence O'Connell, Neil Katz, Victor Moore, Peer-to-peer internet trading system with distributed search engine ,(2002)
Gail Anne Mitchell, Wang-Chien Lee, Elke Angelika Rundensteiner, Xin Zhang, System and method for synchronizing and/or updating an existing relational database with supplemental XML data ,(2001)
Gregory L. Slaughter, Thomas E. Saulpaugh, Method and apparatus to discover services using flexible search criteria ,(2000)
Mitsuru Yoshikura, Hiromoto Uesugi, Kazuhito Kojima, Database system and a method of data retrieval from the system ,(2003)