840 search results - page 72 / 168 » Inapproximability of Combinatorial Optimization Problems |
76
Voted
HPDC
2000
IEEE
15 years 4 months ago
2000
IEEE
We describe MW – a software framework that allows users to quickly and easily parallelize scientific computations using the master-worker paradigm on the computationalgrid. MW ...
101
click to vote
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
114
click to vote
ICALP
2009
Springer
16 years 21 days ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
118
click to vote
ESA
1998
Springer
15 years 4 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
135
click to vote
NPL
1998
15 years 2 days ago
1998
Abstract. The resolution of combinatorial optimization problems can greatly benefit from the parallel and distributed processing which is characteristic of neural network paradigm...