Sciweavers

6110 search results - page 414 / 1222
» Approximate Computing
Sort
View
COMPUTING
1999
128views more  COMPUTING 1999»
15 years 6 months ago
A Multigrid Method for Nonconforming FE-Discretisations with Application to Non-Matching Grids
Nonconforming finite element discretisations require special care in the construction of the prolongation andrestrictioninthemultigridprocess. Inthispaper,ageneralschemeisproposed...
Dietrich Braess, Maksimillian Dryja, Wolfgang Hack...
SIAMJO
2000
88views more  SIAMJO 2000»
15 years 6 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
MOC
1998
73views more  MOC 1998»
15 years 6 months ago
Detecting perfect powers in essentially linear time
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
Daniel J. Bernstein
EOR
2008
107views more  EOR 2008»
15 years 6 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
CRV
2007
IEEE
101views Robotics» more  CRV 2007»
15 years 10 months ago
Energy Efficient Robot Rendezvous
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
Pawel Zebrowski, Yaroslav Litus, Richard T. Vaugha...