Sciweavers

4047 search results - page 569 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ECBS
1996
IEEE
93views Hardware» more  ECBS 1996»
15 years 10 months ago
A Methodology for Designing and Dimensioning Critical Complex Computing Systems
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
Gérard Le Lann
MOC
2000
70views more  MOC 2000»
15 years 6 months ago
Extrapolation methods and derivatives of limits of sequences
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
Avram Sidi
CONCURRENCY
1998
139views more  CONCURRENCY 1998»
15 years 6 months ago
Applications experience in Jade
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
Martin C. Rinard
SIAMCOMP
2010
109views more  SIAMCOMP 2010»
15 years 1 months ago
Analysis of Delays Caused by Local Synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 22 days ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma