Sciweavers

1541 search results - page 197 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
DAMON
2008
Springer
13 years 10 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
ALGORITHMICA
2002
83views more  ALGORITHMICA 2002»
13 years 8 months ago
A Tutorial for Designing Flexible Geometric Algorithms
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...
Vikas Kapoor, Dietmar Kühl, Alexander Wolff
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
ITIIS
2010
158views more  ITIIS 2010»
13 years 3 months ago
Development of a Dynamic Collision Avoidance Algorithm for Indoor Tracking System Based on Active RFID
We propose a novel collision-avoidance algorithm for the active type RFID regarding an indoor tracking system. Several well-known collision avoidance algorithms are analyzed consi...
Sekyung Han, Yeonsuk Choi, Masayuki Iwai, Kaoru Se...
DCOSS
2005
Springer
14 years 1 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das