The computationally NP-hard timetabling problem has been solved manually for a long time. The problem's complexity has thwarted attempts to use computer based deterministic methods, to solve it.
|
|
Scooped by
Scott Turner
onto artificial intelligence for students February 11, 2013 3:56 PM
|
Your new post is loading...
