1253 search results - page 65 / 251 » order 2000 |
CL
2000
Springer
14 years 2 months ago
2000
Springer
We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits...
CRYPTO
2000
Springer
14 years 2 months ago
2000
Springer
In order to avoid birthday attacks on message authentication schemes, it has been suggested that one add randomness to the scheme. One must be careful about how randomness is added...
DARS
2000
Springer
14 years 2 months ago
2000
Springer
This paper discusses the use of cooperation and distributed intelligence within a robot team to solve a maze problem in which a set of ordered control point tasks has to be perform...
DARS
2000
Springer
14 years 1 months ago
2000
Springer
In order for robotic systems to be successful in domains with other agents possibly interfering with the accomplishing of goals, the agents must be able to adapt to the opponents&#...
ESOP
2000
Springer
14 years 1 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...