Sciweavers

951 search results - page 145 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
ICLP
2010
Springer
15 years 8 months ago
Dedicated Tabling for a Probabilistic Setting
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
Theofrastos Mantadelis, Gerda Janssens
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 7 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 7 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
CODES
2006
IEEE
15 years 7 months ago
Increasing hardware efficiency with multifunction loop accelerators
To meet the conflicting goals of high-performance low-cost embedded systems, critical application loop nests are commonly executed on specialized hardware accelerators. These loop...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...
AFRIGRAPH
2003
ACM
15 years 7 months ago
View-dependent refinement of multiresolution meshes with subdivision connectivity
We present a view-dependent level-of-detail algorithm for triangle meshes with subdivision connectivity. The algorithm is more suitable for textured meshes of arbitrary topology t...
Daniel I. Azuma, Daniel N. Wood, Brian Curless, To...