Abstract | ||
---|---|---|
We show that the search technique of dynamic programming models a form of multiagent computation characterized by the interaction of cooperating/competing agents. For this reason, dynamic programming algorithms can be easily implemented in an object-oriented concurrent language environment. We illustrate this by a simple example implemented in the object-oriented concurrent language LO, involving the finding of the best path from the initial to the final vertex in a network where the connecting edges are associated with cost weights. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1007/3-540-55613-3_8 | Object-Based Concurrent Computing |
Keywords | Field | DocType |
multiagent programming,dynamic programming,dynamic programming algorithm,object oriented | Functional logic programming,Programming language,Programming paradigm,Computer science,Inductive programming,Theoretical computer science,Symbolic programming,Reactive programming,Concurrent object-oriented programming,First-generation programming language,Programming domain | Conference |
ISBN | Citations | PageRank |
3-540-55613-3 | 5 | 0.67 |
References | Authors | |
4 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jean-Marc Andreoli | 1 | 764 | 72.75 |
Remo Pareschi | 2 | 601 | 162.52 |
Marc Bourgois | 3 | 9 | 2.23 |