Sciweavers

1016 search results - page 119 / 204
» Automatic Analysis of Programming Assignments
Sort
View
ICSM
2009
IEEE
15 years 10 months ago
Using information retrieval to support software maintenance tasks
This paper presents an approach based on Information Retrieval (IR) techniques for extracting and representing the unstructured information in large software systems such that it ...
Denys Poshyvanyk
GD
1994
Springer
15 years 7 months ago
A Geometrical Heuristic for Drawing Concept Lattices
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
Gerd Stumme, Rudolf Wille
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 4 months ago
How to Determine a Good Multi-Programming Level for External Scheduling
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar...
117
Voted
MICAI
2000
Springer
15 years 7 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green
GLOBECOM
2007
IEEE
15 years 9 months ago
Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...