5005 search results - page 290 / 1001 » The Design and Analysis of Parallel Algorithms |
147
click to vote
HIPEAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
141
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
133
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
117
click to vote
WISA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The hash algorithm forms the basis of many popular cryptographic protocols and it is therefore important to find throughput optimal implementations. Though there have be...
203
click to vote
FOGA
2011
14 years 8 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...