Sciweavers

15073 search results - page 311 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 3 months ago
Computational Complexity of Iterated Maps on the Interval
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
Christoph Spandl
COMPGEOM
1995
ACM
15 years 8 months ago
Representation and Computation of Boolean Combinations of Sculptured Models
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
Shankar Krishnan, Atul Narkhede, Dinesh Manocha
CAV
2007
Springer
120views Hardware» more  CAV 2007»
15 years 11 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...
IPPS
2002
IEEE
15 years 9 months ago
Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
Hongtu Chen, Muthucumaru Maheswaran
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
15 years 10 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur