6105 search results - page 787 / 1221 » A Parallel Algorithm for Bound-Smoothing |
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
Voted
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...
186
click to vote
CCGRID
2010
IEEE
15 years 8 months ago
2010
IEEE
Desktop Grids have become very popular nowadays, with projects that include hundred of thousands computers. Desktop grid scheduling faces two challenges. First, the platform is vo...
224
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...