606 search results - page 83 / 122 » Complexity Results for Checking Distributed Implementability |
ESA
2004
Springer
15 years 7 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
127
click to vote
CLUSTER
2003
IEEE
15 years 7 months ago
2003
IEEE
— The efforts to construct a national scale Grid computing environment have brought unprecedented computing capacity and complicacy. Exploiting this complex infrastructure requir...
114
click to vote
ICPADS
2002
IEEE
15 years 6 months ago
2002
IEEE
Wireless technologies and applications received great attention in recent years. The medium access control (MAC) protocol is the main element that determines the efficiency in sha...
116
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
93
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
We present a new arrangement of directory bits called the segment directory to improve directory storage efficiency: a segment directory can point to several sharing processors wi...