4539 search results - page 890 / 908 » Approaches to Compute Workflow Complexity |
GRAPHITE
2003
ACM
14 years 20 days ago
2003
ACM
We consider a repository of animation models and motions that can be reused to generate new animation sequences. For instance, a user can retrieve an animation of a dog kicking it...
ICAIL
2003
ACM
14 years 20 days ago
2003
ACM
Problems with legal quality will not only increase effort and costs of the law enforcement organisations, but also undermines the regulating power of the legislator. Unintended us...
MOBICOM
2003
ACM
14 years 19 days ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
NETGAMES
2003
ACM
14 years 19 days ago
2003
ACM
Plenty of work was contributed in the field of protocol design and performance evaluation of multi-hop networks. It is generally accepted that mobility has a huge impact on the p...
ICALP
2003
Springer
14 years 18 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...