Sciweavers

1016 search results - page 163 / 204
» Automatic Analysis of Programming Assignments
Sort
View
ICALP
2004
Springer
15 years 7 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
BMCBI
2006
155views more  BMCBI 2006»
15 years 2 months ago
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
Martin Petrek, Michal Otyepka, Pavel Banás,...
AOSD
2009
ACM
15 years 9 months ago
Dependent advice: a general approach to optimizing history-based aspects
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
Eric Bodden, Feng Chen, Grigore Rosu
ACMSE
2006
ACM
15 years 4 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
SIGIR
2005
ACM
15 years 8 months ago
An application of text categorization methods to gene ontology annotation
This paper describes an application of IR and text categorization methods to a highly practical problem in biomedicine, specifically, Gene Ontology (GO) annotation. GO annotation...
Kazuhiro Seki, Javed Mostafa