1631 search results - page 63 / 327 » Observing Functional Logic Computations |
CCS
2011
ACM
12 years 10 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
JACM
2002
13 years 9 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
FPL
2000
Springer
14 years 1 months ago
2000
Springer
abstract the dynamic nature of a computation to embedded data memory (which is accessible on-chip). The dynamic nature of a computation corresponds to the dynamic features of its i...