{"title":"DOC:一种新的用于DCSP解析的多代理方法","authors":"Kais Ben Salah, K. Ghédira","doi":"10.1145/1416729.1416767","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new complete method to solve Distributed Constraint Satisfaction Problems (DCSP). DOC-SAT is a Multi-Agent model based on two classes of agents; Decision-Maker agent and Advisor agent that interact to solve inter and intra-agent constraints. The Architecture, dynamic, experimentations and comparison with the Asynchronous Backtracking algorithm are discussed.","PeriodicalId":321308,"journal":{"name":"NOuvelles TEchnologies de la REpartition","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"DOC: a new multi-agent approach for DCSP resolution\",\"authors\":\"Kais Ben Salah, K. Ghédira\",\"doi\":\"10.1145/1416729.1416767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new complete method to solve Distributed Constraint Satisfaction Problems (DCSP). DOC-SAT is a Multi-Agent model based on two classes of agents; Decision-Maker agent and Advisor agent that interact to solve inter and intra-agent constraints. The Architecture, dynamic, experimentations and comparison with the Asynchronous Backtracking algorithm are discussed.\",\"PeriodicalId\":321308,\"journal\":{\"name\":\"NOuvelles TEchnologies de la REpartition\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"NOuvelles TEchnologies de la REpartition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1416729.1416767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"NOuvelles TEchnologies de la REpartition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1416729.1416767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
DOC: a new multi-agent approach for DCSP resolution
In this paper, we present a new complete method to solve Distributed Constraint Satisfaction Problems (DCSP). DOC-SAT is a Multi-Agent model based on two classes of agents; Decision-Maker agent and Advisor agent that interact to solve inter and intra-agent constraints. The Architecture, dynamic, experimentations and comparison with the Asynchronous Backtracking algorithm are discussed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
