8125 search results - page 1147 / 1625 » Parallelism and evolutionary algorithms |
221
click to vote
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
215
click to vote
DCOSS
2010
Springer
15 years 10 months ago
2010
Springer
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
196
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
234
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
164
click to vote
WOTUG
2007
15 years 8 months ago
2007
Abstract. The advent of mass-market multicore processors provides exciting new opportunities for parallelism on the desktop. The original C++CSP – a library providing concurrency...