399 search results - page 60 / 80 » Parallel evolutionary algorithms can achieve super-linear pe... |
121
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
MICRO
1999
IEEE
15 years 4 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
IEEEPACT
2007
IEEE
15 years 6 months ago
2007
IEEE
Multi-core processors naturally exploit thread-level parallelism (TLP). However, extracting instruction-level parallelism (ILP) from individual applications or threads is still a ...
100
click to vote
ASPDAC
2005
ACM
15 years 1 months ago
2005
ACM
In this paper we propose a fault-tolerant processor architecture and an associated fault-tolerant computation model capable of fault tolerance in the nanoelectronic environment th...
LREC
2008
15 years 1 months ago
2008
Awide spectrum of multilingual applications have aligned parallel corpora as their prerequisite. The aim of the project described in this paper is to build a multilingual corpus w...