Sciweavers

523 search results - page 72 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
COCOON
2006
Springer
13 years 11 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
OPODIS
2003
13 years 9 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
14 years 4 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
RAID
1999
Springer
13 years 11 months ago
Towards trapping wily intruders in the large
The rapid increase in network bandwidth from mega bits per second to giga bits per second and potentially to tera bits per second, is making it increasingly difficult to carry out...
Glenn Mansfield
ALGORITHMICA
2008
131views more  ALGORITHMICA 2008»
13 years 7 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