Sciweavers

209 search results - page 11 / 42
» Using Run-Time Data for Program Comprehension
Sort
View
CEC
2010
IEEE
14 years 3 months ago
Discriminating normal and cancerous thyroid cell lines using implicit context representation Cartesian genetic programming
Abstract— In this paper, we describe a method for discriminating between thyroid cell lines. Five commercial thyroid cell lines were obtained, ranging from non-cancerous to cance...
Michael A. Lones, Stephen L. Smith, Andrew T. Harr...
CGO
2007
IEEE
15 years 6 months ago
Exploiting Narrow Accelerators with Data-Centric Subgraph Mapping
The demand for high performance has driven acyclic computation accelerators into extensive use in modern embedded and desktop architectures. Accelerators that are ideal from a sof...
Amir Hormati, Nathan Clark, Scott A. Mahlke
COCOA
2008
Springer
15 years 1 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
ISCAPDCS
2003
15 years 1 months ago
Parallel Relative Debugging with Dynamic Data Structures
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 3 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig