30 likes | 141 Views
CFPA - General Description. External constrains are relatively difficult. Canonical representation of a problem. How does it work? Advantages - distributed work on the whole problem (real life). small amount of messages. Disadvantage - waste of time, due to unnecessary search.
E N D
CFPA - General Description • External constrains are relatively difficult. • Canonical representation of a problem. • How does it work? • Advantages - • distributed work on the whole problem (real life). • small amount of messages. • Disadvantage - • waste of time, due to unnecessary search. DCSP Project -CFPAReuven Yagel & Daniel Lishha
CFPA - Implementation • Implement in Java algorithms FC-CBJ and CFPA - OOP. • Heuristics: • Variable ordering according to domain size. • Variable ordering, according to external property. • Directed back jumping - to last external. • Skipping of external solution - hash. • Reducing number of messages - hash. • Agent don't waste time - hash. DCSP Project -CFPAReuven Yagel & Daniel Lishha
CFPA - Protocol • Inner Protocol: • Problem Reprentesation: Network. • Comunccation: MailBox(threads), Message. • Input - • Problem Reprentesation: Agent. • CFPA cfpa = new CFPA(mbox, agent, WITH_HEURISTICS);cfpa.run(); • Output - • Statistics: Number of consistency checks X 4 & number of messages sent. • A solution, if exist. DCSP Project -CFPAReuven Yagel & Daniel Lishha