93 search results - page 19 / 19 » Identifiability: A Fundamental Problem of Student Modeling |
SPAA
2004
ACM
14 years 23 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
TMC
2010
13 years 5 months ago
2010
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
HOTNETS
2010
13 years 2 months ago
2010
There are a lot of applications that run on modern mobile operating systems. Inevitably, some of these applications fail in the hands of users. Diagnosing a failure to identify the...