1494 search results - page 77 / 299 » Less Extreme Programming |
101
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
131
click to vote
EOR
2011
14 years 5 months ago
2011
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer:...
141
Voted
JMLR
2012
13 years 4 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
113
click to vote
SPAA
1997
ACM
15 years 5 months ago
1997
ACM
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
117
click to vote
SIGSOFT
2004
ACM
16 years 3 months ago
2004
ACM
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...