Sciweavers

6149 search results - page 457 / 1230
» Revealing the programming process
Sort
View
SIGSOFT
2001
ACM
16 years 7 months ago
An empirical study on the utility of formal routines to transfer knowledge and experience
Most quality and software process improvement frameworks emphasize written (i.e. formal) documentation to convey recommended work practices. However, there is considerable skeptic...
Reidar Conradi, Tore Dybå
JCO
2002
96views more  JCO 2002»
15 years 6 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
ISMM
2009
Springer
16 years 1 months ago
Milena: Write Generic Morphological Algorithms Once, Run on Many Kinds of Images
Abstract. We present a programming framework for discrete mathematical morphology centered on the concept of genericity. We show that formal definitions of morphological algorithm...
Roland Levillain, Thierry Géraud, Laurent N...
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
CC
2010
Springer
190views System Software» more  CC 2010»
16 years 1 months ago
Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Xipeng She...