Algorithms for Solving the Multiagent Simple Temporal Problem thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Algorithms for Solving the Multiagent Simple Temporal Problem

Published on Nov 15, 20104227 Views

The Simple Temporal Problem (STP) is a popular representation for solving centralized scheduling and planning problems. When scheduling agents are associated with different users who need to coordi

Related categories