976 search results - page 72 / 196 » The Complexity of Timetable Construction Problems |
ICLP
1997
Springer
14 years 18 days ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
ILP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
AIPS
2007
13 years 11 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
WADS
2001
Springer
14 years 1 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...