1631 search results - page 75 / 327 » Extreme Programming - Back to Basics |
137
Voted
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
159
Voted
TLDI
2010
ACM
15 years 2 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
101
click to vote
PDP
2010
IEEE
15 years 9 months ago
2010
IEEE
—Multicore nodes have become ubiquitous in just a few years. At the same time, writing portable parallel software for multicore nodes is extremely challenging. Widely available p...
173
click to vote
PPOPP
2011
ACM
14 years 5 months ago
2011
ACM
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
143
Voted
SODA
2010
ACM
16 years 8 hour ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...