Sciweavers

15792 search results - page 224 / 3159
» Computational Abstraction Steps
Sort
View
COMPGEOM
2000
ACM
15 years 11 months ago
Computing approximate shortest paths on convex polytopes
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
IPPS
1998
IEEE
15 years 11 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
CCGRID
2009
IEEE
15 years 11 months ago
On-Demand Resource Provisioning for BPEL Workflows Using Amazon's Elastic Compute Cloud
BPEL is the de facto standard for business process modeling in today's enterprises and is a promising candidate for the integration of business and Grid applications. Current ...
Tim Dörnemann, Ernst Juhnke, Bernd Freisleben
ETD2000
1995
15 years 10 months ago
Automatic generation of a neural network architecture using evolutionary computation
This paper reports the application of evolutionary computation in the automatic generation of a neural network architecture.It is a usual practice to use trial and error to find a...
E. Vonk, Lakhmi C. Jain, L. P. J. Veelenturf, R. J...
CAV
2009
Springer
132views Hardware» more  CAV 2009»
16 years 7 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas