| Michael Fisher and Michael Wooldridge. Distributed problem-solving<E-377> as concurrent theorem-proving. Proceedings of MAAMAW'97, Lecture notes in<E-435> Artificial Intelligence, Springer-Verlag.<E-126> |
....results formed is large E 432 and only few are really needed by others, then sending requests (or more generally, E 405 goals) to others makes more sense. This strategy has been explored in the DVM E 411 problem [Corkill 1982] as well as in distributed theorem proving [MacIntosh 1991; E 425 Fisher 1997] For example, in DARES [MacIntosh 1991] when a theorem proving E 408 agent would fail to make progress, it would request clauses from other such agents, E 422 where the set of desired literals would be heuristically chosen (Figure 5) E 386 It is also important to consider the delays in ....
Michael Fisher and Michael Wooldridge. Distributed problem-solving<E-377> as concurrent theorem-proving. Proceedings of MAAMAW'97, Lecture notes in<E-435> Artificial Intelligence, Springer-Verlag.<E-126>
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC