556 search results - page 53 / 112 » Pair Programming: Not for Everyone |
FOSSACS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
ICFP
1997
ACM
14 years 1 months ago
1997
ACM
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
GCB
1997
Springer
14 years 1 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
ICCBR
1995
Springer
14 years 19 days ago
1995
Springer
In this work, we are interested in how rational decision makers reason with and about reasons in a domain, practical ethics, where they appear to reason asons symbolically in terms...
MVA
2007
13 years 10 months ago
2007
In this paper, we show that we can improve accuracies of 3-D reconstructions with uncalibrated stereo by classifying correspondences between two images. After obtaining initial co...