Sciweavers

2034 search results - page 305 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
TPDS
2008
124views more  TPDS 2008»
13 years 8 months ago
Efficient Breadth-First Search on the Cell/BE Processor
Multicore processors are an architectural paradigm shift that promises a dramatic increase in performance. But, they also bring an unprecedented level of complexity in algorithmic ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
ICSM
2008
IEEE
14 years 2 months ago
Understanding the rationale for updating a function's comment
Up-to-date comments are critical for the successful evolution of a software application. When modifying a function, developers may update the comment associated with the function ...
Haroon Malik, Istehad Chowdhury, Hsiao-Ming Tsou, ...
ALMOB
2006
106views more  ALMOB 2006»
13 years 8 months ago
Multiple sequence alignment with user-defined anchor points
Background: Automated software tools for multiple alignment often fail to produce biologically meaningful results. In such situations, expert knowledge can help to improve the qua...
Burkhard Morgenstern, Sonja J. Prohaska, Dirk P&ou...
LCPC
2009
Springer
14 years 18 days ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
PASTE
2010
ACM
13 years 11 months ago
The RoadRunner dynamic analysis framework for concurrent programs
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...
Cormac Flanagan, Stephen N. Freund