Login / Signup
An algorithm that uses forward planning to expedite conflict-free traffic assignment in time-multiplex switching systems.
Victor W. C. Yau
Krzysztof Pawlikowski
Published in:
IEEE Trans. Commun. (1999)
Keyphrases
</>
conflict free
dynamic programming
traffic assignment
objective function
linear programming
convergence rate
expectation maximization
database
simulated annealing
np hard
computational complexity
data management
convex hull
functional dependencies
search space
total variation
benchmark problems
databases