Sciweavers

184 search results - page 20 / 37
» Timing budgeting under arbitrary process variations
Sort
View
SSS
2007
Springer
15 years 4 months ago
Stabilization of Loop-Free Redundant Routing
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...
Jorge Arturo Cobb
ASMTA
2009
Springer
104views Mathematics» more  ASMTA 2009»
15 years 4 months ago
Preliminary Results on a Simple Approach to G/G/c-Like Queues
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent...
Alexandre Brandwajn, Thomas Begin
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 10 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...
VLSID
2007
IEEE
149views VLSI» more  VLSID 2007»
15 years 10 months ago
Efficient and Accurate Statistical Timing Analysis for Non-Linear Non-Gaussian Variability With Incremental Attributes
Title of thesis: EFFICIENT AND ACCURATE STATISTICAL TIMING ANALYSIS FOR NON-LINEAR NON-GAUSSIAN VARIABILITY WITH INCREMENTAL ATTRIBUTES Ashish Dobhal, Master of Science, 2006 Thes...
Ashish Dobhal, Vishal Khandelwal, Ankur Srivastava
ISCAS
2007
IEEE
117views Hardware» more  ISCAS 2007»
15 years 4 months ago
Quantifying Input and Output Spike Statistics of a Winner-Take-All Network in a Vision System
— Event-driven spike-based processing systems offer new possibilities for real-time vision. Signals are encoded asynchronously in time thus preserving the time information of the...
Matthias Oster, Rodney J. Douglas, Shih-Chii Liu