299 search results - page 52 / 60 » DNA Computing for Complex Scheduling Problem |
94
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
107
click to vote
IJNSEC
2008
14 years 11 months ago
2008
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
90
Voted
SI3D
2005
ACM
15 years 5 months ago
2005
ACM
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
112
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
92
Voted
WAN
1998
Springer
15 years 3 months ago
1998
Springer
In this paper the Northrhine-Westphalian metacomputing initiative is described. We start by discussing various general aspects of metacomputing and explain the reasons for founding...