6110 search results - page 771 / 1222 » Approximate Computing |
161
Voted
HPCC
2007
Springer
16 years 29 days ago
2007
Springer
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
161
click to vote
INFOCOM
2006
IEEE
16 years 25 days ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
156
click to vote
WEBDB
2005
Springer
16 years 8 days ago
2005
Springer
This document presents the JXP algorithm for dynamically and collaboratively computing PageRank-style authority scores of Web pages distributed in a P2P network. In the architectu...
144
click to vote
CGF
2008
15 years 7 months ago
2008
This paper presents a new, scalable, single pass algorithm for computing subsurface scattering using the diffusion approximation. Instead of pre-computing a globally conservative ...
145
click to vote
ICRA
2003
IEEE
16 years 2 days ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...