7289 search results - page 338 / 1458 » A Dependent Set Theory |
169
click to vote
PLILP
1993
Springer
15 years 11 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
196
click to vote
RTA
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
201
click to vote
ECCV
1994
Springer
15 years 11 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
185
click to vote
APLAS
2010
ACM
15 years 7 months ago
2010
ACM
Semantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially...
201
click to vote
INFSOF
2006
15 years 6 months ago
2006
We conducted an industrial case study of a distributed team in the USA and the Czech Republic that used Extreme Programming. Our goal was to understand how this globally-distribut...