1568 search results - page 7 / 314 » The problem of examination questions in algorithmics |
ITS
2004
Springer
14 years 23 days ago
2004
Springer
Cognitive Tutors are proven effective learning environments, but are still not as effective as one-on-one human tutoring. We describe an environment (ALPS) designed to engage stude...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper examines the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalizable to...
CIKM
2004
Springer
14 years 24 days ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
SIGAL
1990
13 years 11 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
ICALP
2003
Springer
14 years 18 days ago
2003
Springer
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...