1016 search results - page 145 / 204 » Automatic Analysis of Programming Assignments |
111
Voted
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
141
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
96
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
To implement a persistent tracker, we build a set of viewdependent object appearance models adaptively and automatically while tracking an object under different viewing angles. T...
141
Voted
MM
2009
ACM
15 years 9 months ago
2009
ACM
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
127
click to vote
CIMCA
2008
IEEE
15 years 9 months ago
2008
IEEE
The process of evaluating, classifying, and assigning bugs to programmers is a difficult and time consuming task which greatly depends on the quality of the bug report itself. It ...