Sciweavers

1016 search results - page 114 / 204
» Automatic Analysis of Programming Assignments
Sort
View
140
Voted
ISSTA
2000
ACM
15 years 7 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
MM
2004
ACM
188views Multimedia» more  MM 2004»
15 years 8 months ago
A new method to segment playfield and its applications in match analysis in sports video
With the growing popularity of digitized sports video, automatic analysis of them need be processed to facilitate semantic summarization and retrieval. Playfield plays the fundame...
Shuqiang Jiang, Qixiang Ye, Wen Gao, Tiejun Huang
124
Voted
LICS
2009
IEEE
15 years 10 months ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 9 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
120
Voted
SIGADA
2004
Springer
15 years 8 months ago
A refactoring tool for Ada 95
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
Paul Anderson