4539 search results - page 355 / 908 » Approaches to Compute Workflow Complexity |
167
click to vote
ICAS
2009
IEEE
16 years 1 months ago
2009
IEEE
Recent years have seen a growing interest in autonomic computing, an approach to providing systems with self managing properties [1]. Autonomic computing aims to address the incre...
182
click to vote
VR
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
164
click to vote
COCOA
2007
Springer
16 years 27 days ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
172
click to vote
VOSS
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
161
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...