Sciweavers

5640 search results - page 1036 / 1128
» Parallelizing the Data Cube
Sort
View
DAC
2004
ACM
14 years 20 days ago
Communication-efficient hardware acceleration for fast functional simulation
This paper presents new technology that accelerates system verification. Traditional methods for verifying functional designs are based on logic simulation, which becomes more tim...
Young-Il Kim, Woo-Seung Yang, Young-Su Kwon, Chong...
GECCO
2006
Springer
182views Optimization» more  GECCO 2006»
14 years 17 days ago
Distributed genetic algorithm for energy-efficient resource management in sensor networks
In this work we consider energy-efficient resource management in an environment monitoring and hazard detection sensor network. Our goal is to allocate different detection methods...
Qinru Qiu, Qing Wu, Daniel J. Burns, Douglas Holzh...
ARITH
2001
IEEE
14 years 17 days ago
On-line Arithmetic for Detection in Digital Communication Receivers
This paper demonstrates the advantages of using on-line arithmetic for traditional and advanced detection algorithms for communication systems. Detection is one of the core comput...
Sridhar Rajagopal, Joseph R. Cavallaro
WAN
1998
Springer
14 years 15 days ago
Performance Analysis of Wavefront Algorithms on Very-Large Scale Distributed Systems
We present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combine...
Adolfy Hoisie, Olaf M. Lubeck, Harvey J. Wasserman
LICS
1997
IEEE
14 years 14 days ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
« Prev « First page 1036 / 1128 Last » Next »