Sciweavers

1089 search results - page 71 / 218
» Randomness and Reducibility
Sort
View
DCC
2000
IEEE
14 years 1 months ago
Arithmetic Coding for Low Power Embedded System Design
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
Haris Lekatsas, Wayne Wolf, Jörg Henkel
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 9 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
IROS
2009
IEEE
227views Robotics» more  IROS 2009»
14 years 3 months ago
Cell-RRT: Decomposing the environment for better plan
— In order to define an architecture for task and motion planning of a mobile robot, we propose the CellRRT path planner that combines the advantages of planning approaches by d...
Julien Guitton, Jean-Loup Farges, Raja Chatila
COLCOM
2005
IEEE
14 years 2 months ago
Symbiotic multi-path routing with attractor selection
In this paper we discuss the effects of symbiosis when using an attractor selection model for multi-path routing in an overlay network. Attractor selection is a biologically inspi...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
SIGCOMM
2006
ACM
14 years 3 months ago
Minimizing churn in distributed systems
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
Brighten Godfrey, Scott Shenker, Ion Stoica