Sciweavers

207 search results - page 16 / 42
» Using Clustering Technique to Restructure Programs
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Trace-Driven Debugging of Message Passing Programs
In this paper we report on features added to a parallel debugger to simplify the debugging of message passing programs. These features include replay, setting consistent breakpoin...
Michael A. Frumkin, Robert Hood, Luis Lopez
SIGSOFT
2008
ACM
14 years 10 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
GECCO
2006
Springer
14 years 1 months ago
MOGE: GP classification problem decomposition using multi-objective optimization
A novel approach to classification is proposed in which a Paretobased ranking of individuals is used to encourage multiple individuals to participate in the solution. To do so, th...
Andrew R. McIntyre, Malcolm I. Heywood
ICALP
2011
Springer
13 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
CSB
2003
IEEE
128views Bioinformatics» more  CSB 2003»
14 years 3 months ago
Degenerate Primer Design via Clustering
This paper describes a new strategy for designing degenerate primers for a given multiple alignment of amino acid sequences. Degenerate primers are useful for amplifying homologou...
Xintao Wei, David N. Kuhn, Giri Narasimhan