556 search results - page 70 / 112 » Pair Programming: Not for Everyone |
BMCBI
2008
13 years 9 months ago
2008
Background: Many programs have been developed to identify transcription factor binding sites. However, most of them are not able to infer two-word motifs with variable spacer leng...
ICSE
2003
IEEE-ACM
14 years 9 months ago
2003
IEEE-ACM
Some "non-' or "extra-functional" features, such as reliability, security, and tracing, defy modularization mechanisms in programming languages. This makes suc...
ASPLOS
2010
ACM
14 years 4 months ago
2010
ACM
DRAM is facing severe scalability challenges in sub-45nm technology nodes due to precise charge placement and sensing hurdles in deep-submicron geometries. Resistive memories, suc...
WEA
2010
Springer
14 years 4 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
This paper presents a tree-pattern-based method of automatically and accurately finding code clones in program files. Duplicate tree-patterns are first collected by anti-unificati...