3381 search results - page 538 / 677 » Extending Dependencies with Conditions |
189
click to vote
AAAI
1998
15 years 8 months ago
1998
We explore techniques for maintaining consistency in reasoning when employing dynamic hierarchical task decompositions. In particular, we consider the difficulty of maintaining co...
184
click to vote
WISES
2003
15 years 8 months ago
2003
— This paper is about collision avoidance of crowd robots. For this purpose a model of potential field is proposed. This potential field, generated by a neural network, is uniq...
197
click to vote
ICMAS
1998
15 years 8 months ago
1998
We present a decentralized, asynchronous market protocol for allocating and scheduling tasks among agents that contend for scarce resources, constrained by a hierarchical task dep...
170
click to vote
IJCAI
1997
15 years 8 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
233
Voted
UAI
2000
15 years 8 months ago
2000
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...