976 search results - page 104 / 196 » The Complexity of Timetable Construction Problems |
IMR
2003
Springer
14 years 2 months ago
2003
Springer
Topology modification of hexahedral meshes has been considered difficult due to the propagation of topological modifications non-locally. We address this problem by working in the...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
CCA
2000
Springer
14 years 1 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
SIGCSE
1998
ACM
14 years 1 months ago
1998
ACM
Programs that use animations or visualizations attract student interest and offer feedback that can enhance different learning styles as students work to master programming and pr...
ICALP
1998
Springer
14 years 1 months ago
1998
Springer
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...