556 search results - page 94 / 112 » Pair Programming: Not for Everyone |
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
IEEESCC
2009
IEEE
13 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
COLING
2010
13 years 5 months ago
2010
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...