1480 search results - page 154 / 296 » Distributed algorithms for weighted problems in sparse graph... |
111
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
92
Voted
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
122
Voted
ICPADS
1998
IEEE
15 years 5 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
SEMWEB
2009
Springer
15 years 7 months ago
2009
Springer
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
126
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...