976 search results - page 120 / 196 » The Complexity of Timetable Construction Problems |
IUI
1998
ACM
14 years 1 months ago
1998
ACM
Interactive3Dlearningenvironmentscanproviderichproblemsolving experiences with unparalleled visual impact. In these environments, students interactively solve problems by directin...
CHI
2007
ACM
14 years 28 days ago
2007
ACM
Software developers must modify their programs to keep up with changing requirements and designs. Often, a conceptually simple change can require numerous edits that are similar b...
FASE
2000
Springer
14 years 16 days ago
2000
Springer
The problem of consistently engineering large, complex software systems of today is often addressed by introducing new, "improved" models. Examples of such models are arc...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
NIPS
2007
13 years 10 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....