Sciweavers

8780 search results - page 195 / 1756
» On the Feasibility of Consistent Computations
Sort
View
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
VTC
2007
IEEE
111views Communications» more  VTC 2007»
16 years 1 months ago
Analysis of a Spline Based, Obstacle Avoiding Path Planning Algorithm
—The Overbot is one of the original DARPA Grand Challenge vehicles now being used as a platform for autonomous vehicle research. The vehicle, equipped with a complete actuator an...
John Connors, Gabriel Elkaim
ECRTS
2003
IEEE
16 years 15 days ago
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
Shelby Funk, Sanjoy K. Baruah
ICRA
2002
IEEE
223views Robotics» more  ICRA 2002»
16 years 4 days ago
Dynamic Motion Planning Whole Arm Grasp Systems Based on Switching Contact Modes
We present motion planning for dexterous manipulation by whole arm grasp system based on switching contact modes. Motion planning for such a system should consider changing dynami...
Masahito Yashima, Hideya Yamaguchi
RTSS
1998
IEEE
15 years 11 months ago
Statistical Rate Monotonic Scheduling
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
Alia Atlas, Azer Bestavros