1353 search results - page 152 / 271 » Streamlined Constraint Reasoning |
FLOPS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
CADE
2001
Springer
15 years 2 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...
108
click to vote
ECOOP
1993
Springer
15 years 2 months ago
1993
Springer
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...
ESWS
2007
Springer
15 years 1 months ago
2007
Springer
Many approaches to learning and teaching rely upon students working in groups. Formation of optimal groups can be a time consuming and complex task, particularly when the list of ...