Sciweavers

722 search results - page 126 / 145
» Efficient Generation of Prime Numbers
Sort
View
119
Voted
IISWC
2008
IEEE
15 years 10 months ago
Accelerating multi-core processor design space evaluation using automatic multi-threaded workload synthesis
The design and evaluation of microprocessor architectures is a difficult and time-consuming task. Although small, handcoded microbenchmarks can be used to accelerate performance e...
Clay Hughes, Tao Li
GLOBECOM
2006
IEEE
15 years 9 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
167
Voted
ICPADS
1994
IEEE
15 years 7 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
172
Voted
AIIDE
2009
15 years 4 months ago
Using Semantics to Improve the Design of Game Worlds
Design of game worlds is becoming more and more laborintensive because of the increasing demand and complexity of content. This is being partially addressed by developing semi-aut...
Tim Tutenel, Ruben Michaël Smelik, Rafael Bid...
272
Voted
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
15 years 3 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig