2434 search results - page 237 / 487 » Algorithmic Randomness of Closed Sets |
149
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this study, we investigate the task scheduling problem in heterogeneous computing environments and propose a novel scheduling algorithm, called the Artificial Immune System wit...
144
click to vote
SMI
2003
IEEE
15 years 9 months ago
2003
IEEE
We study the use of neural network algorithms in surface reconstruction from an unorganized point cloud, and meshing of an implicit surface. We found that for such applications, t...
135
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
With the emerging process variations in fabrication, the traditional corner-based timing optimization techniques become prohibitive. Buffer insertion is a very useful technique fo...
166
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
127
click to vote
ASUNAM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...