Sciweavers

1278 search results - page 171 / 256
» Design and Analysis of Parametric Query Optimization Algorit...
Sort
View
CN
2007
148views more  CN 2007»
14 years 9 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
DAC
2004
ACM
15 years 10 months ago
Worst-case circuit delay taking into account power supply variations
Current Static Timing Analysis (STA) techniques allow one to verify the timing of a circuit at different process corners which only consider cases where all the supplies are low o...
Dionysios Kouroussis, Rubil Ahmadi, Farid N. Najm
INFOCOM
2003
IEEE
15 years 3 months ago
Capacity, Delay and Mobility in Wireless Ad-Hoc Networks
Abstract— Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been show...
Nikhil Bansal, Zhen Liu
ALGORITHMICA
2008
131views more  ALGORITHMICA 2008»
14 years 10 months ago
Sorting and Searching in Faulty Memories
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
Irene Finocchi, Giuseppe F. Italiano
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
15 years 3 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha