9572 search results - page 101 / 1915 » Cover Algorithms and Their Combination |
108
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
104
click to vote
STOC
2004
ACM
16 years 5 days ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
TPHOL
2003
IEEE
15 years 5 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
IJCAI
2003
15 years 1 months ago
2003
The intelligent tutoring system AutoTutor uses latent semantic analysis to evaluate student answers to the tutor's questions. By comparing a student's answer to a set of...
109
click to vote
CCGRID
2001
IEEE
15 years 3 months ago
2001
IEEE
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...