Sciweavers

16430 search results - page 2479 / 3286
» On Computable Tree Functions
Sort
View
DAC
2004
ACM
15 years 11 months ago
A methodology to improve timing yield in the presence of process variations
The ability to control the variations in IC fabrication process is rapidly diminishing as feature sizes continue towards the sub-100 nm regime. As a result, there is an increasing...
Sreeja Raj, Sarma B. K. Vrudhula, Janet Meiling Wa...
ECUMN
2004
Springer
15 years 11 months ago
Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models
Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that...
Paulo Salvador, António Nogueira, Rui Valad...
FOCS
2004
IEEE
15 years 11 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
ERSHOV
2006
Springer
15 years 11 months ago
Streaming Networks for Coordinating Data-Parallel Programs
A new coordination language for distributed data-parallel programs is presented, call SNet. The intention of SNet is to introduce advanced structuring techniques into a coordinatio...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
FLOPS
2006
Springer
15 years 11 months ago
Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
Peter Van Roy
« Prev « First page 2479 / 3286 Last » Next »