921 search results - page 131 / 185 » Expressing Computational Complexity in Constructive Type The... |
JACM
2000
13 years 7 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
AIIA
1995
Springer
13 years 11 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
IJRR
2010
13 years 6 months ago
2010
This paper considers grasps and fixtures whose contacts react according to force-displacement laws consistent with friction constrains at the contacts. The passive force closure s...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...