Sciweavers

4313 search results - page 626 / 863
» Using time travel to diagnose computer problems
Sort
View
GROUP
2009
ACM
16 years 1 months ago
Information handover in time-critical work
Information transfer under time pressure and stress often leads to information loss. This paper studies the characteristics and problems of information handover from the emergency...
Aleksandra Sarcevic, Randall S. Burd
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
16 years 1 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
PODC
2009
ACM
16 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
15 years 7 months ago
Motion Planning of Legged Robots
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
15 years 11 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...