1486 search results - page 71 / 298 » Algorithms for two-box covering |
142
Voted
STOC
2004
ACM
16 years 4 months 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...
110
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
104
Voted
TPHOL
2003
IEEE
15 years 9 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...
129
Voted
IJCAI
2003
15 years 5 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...
133
Voted
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...