Sciweavers

1213 search results - page 97 / 243
» Power scalable processing using distributed arithmetic
Sort
View
MSWIM
2006
ACM
15 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
GCC
2005
Springer
15 years 3 months ago
The Architecture of SIG Computing Environment and Its Application to Image Processing
Spatial Information Grid (SIG) is a project of applying grid technology to share and integrate spatial data resources, information processing resources, equipment resources, and kn...
Chunhui Yang, Deke Guo, Yan Ren, Xueshan Luo, Jinf...
SAC
2010
ACM
15 years 4 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
ICCAD
1995
IEEE
144views Hardware» more  ICCAD 1995»
15 years 1 months ago
Background memory management for dynamic data structure intensive processing systems
Abstract -- Telecommunication network management applications often require application-specific ICs that use large dynamically allocated stored data structures. Currently availab...
Gjalt G. de Jong, Bill Lin, Carl Verdonck, Sven Wu...
ICAS
2009
IEEE
126views Robotics» more  ICAS 2009»
15 years 1 months ago
Heterogeneous QoS Resource Manager with Prediction
As long as computers continue to get more CPU processing power, data centers need to optimize their power usage. We can do this and maintain the same complexity level as before by...
Ramon Nou, Jordi Torres