Sciweavers

4415 search results - page 22 / 883
» How to Pair with a Human
Sort
View
ECLIPSE
2004
ACM
14 years 4 months ago
Sangam: a distributed pair programming plug-in for Eclipse
Pair programming requires two programmers working together at one computer. However, the trend toward globally distributed organizations makes long-distance collaboration necessar...
Chih-Wei Ho, Somik Raha, Edward F. Gehringer, Laur...
FROCOS
2011
Springer
12 years 10 months ago
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
Carsten Fuhs, Cynthia Kop
CADE
2009
Springer
14 years 11 months ago
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
Carsten Fuhs, Jürgen Giesl, Michael Parting, ...
RTA
2009
Springer
14 years 5 months ago
Dependency Pairs and Polynomial Path Orders
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
Martin Avanzini, Georg Moser
LREC
2008
110views Education» more  LREC 2008»
14 years 11 days ago
Developing Non-European Translation Pairs in a Medium-Vocabulary Medical Speech Translation System
We describe recent work on MedSLT, a medium-vocabulary interlingua-based medical speech translation system, focussing on issues that arise when handling languages of which the gra...
Pierrette Bouillon, Sonia Halimi, Yukie Nakao, Kyo...