3663 search results - page 75 / 733 » Problems in the ontology of computer programs |
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
EOR
2010
13 years 8 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
GRC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Granular computing unifies structured thinking, structured problem solving and structured information processing. In order to see the flexibility and universal applicability ...
SIGGRAPH
1994
ACM
14 years 25 days ago
1994
ACM
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
GI
2009
Springer
13 years 6 months ago
2009
Springer
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...