Sciweavers

39362 search results - page 331 / 7873
» Global Computing Systems
Sort
View
APLAS
2004
ACM
15 years 10 months ago
Concurrency Combinators for Declarative Synchronization
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
Pawel T. Wojciechowski
ENTCS
2008
91views more  ENTCS 2008»
15 years 4 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
DAC
2007
ACM
16 years 5 months ago
Voltage-Frequency Island Partitioning for GALS-based Networks-on-Chip
Due to high levels of integration and complexity, the design of multi-core SoCs has become increasingly challenging. In particular, energy consumption and distributing a single gl...
Ümit Y. Ogras, Diana Marculescu, Puru Choudha...
ICAS
2009
IEEE
147views Robotics» more  ICAS 2009»
15 years 11 months ago
Fast Estimation of Aggregates in Unstructured Networks
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global sys...
Carlos Baquero, Paulo Sérgio Almeida, Raque...
CC
2004
Springer
177views System Software» more  CC 2004»
15 years 10 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking