Sciweavers

849 search results - page 80 / 170
» Completely Non-malleable Schemes
Sort
View
IROS
2007
IEEE
136views Robotics» more  IROS 2007»
15 years 11 months ago
A bounded uncertainty approach to cooperative localization using relative bearing constraints
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
Camillo J. Taylor, John R. Spletzer
CODES
2006
IEEE
15 years 10 months ago
Bounded arbitration algorithm for QoS-supported on-chip communication
Time-critical multi-processor systems require guaranteed services in terms of throughput, bandwidth etc. in order to comply to hard real-time constraints. However, guaranteedservi...
Mohammad Abdullah Al Faruque, Gereon Weiss, Jö...
144
Voted
ICPP
2006
IEEE
15 years 10 months ago
A PROactive Request Distribution (PRORD) Using Web Log Mining in a Cluster-Based Web Server
Widely adopted distributor-based systems forward user requests to a balanced set of waiting servers in complete transparency to the users. The policy employed in forwarding reques...
Heung Ki Lee, Gopinath Vageesan, Ki Hwan Yum, Eun ...
IPSN
2004
Springer
15 years 10 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
ECRTS
2000
IEEE
15 years 9 months ago
Tolerating faults while maximizing reward
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
Hakan Aydin, Rami G. Melhem, Daniel Mossé