Sciweavers

485 search results - page 32 / 97
» Iterative Bounding LAO
Sort
View
SAC
2002
ACM
15 years 4 months ago
On optimal temporal locality of stencil codes
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
Claudia Leopold
FCT
2003
Springer
15 years 9 months ago
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
Ivan Damgård, Gudmund Skovbjerg Frandsen
ICFP
1996
ACM
15 years 8 months ago
Inductive, Coinductive, and Pointed Types
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
Brian T. Howard
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 4 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
CSCLP
2008
Springer
15 years 6 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig