4539 search results - page 130 / 908 » Approaches to Compute Workflow Complexity |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Many numerical solutions of large scale simulation models require finer discretizations in some regions of the computational grid. When this region is not known in advance, adapti...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper addresses an optimal technique for throughput optimization of general non-linear data flow computations using a set of transformations. Throughput is widely recognized ...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...