805 search results - page 65 / 161 » Combinatorial optimization problems in self-assembly |
FOCM
2007
14 years 10 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
HPDC
2000
IEEE
15 years 2 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 ...
CDC
2010
IEEE
14 years 5 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...
ICALP
2009
Springer
15 years 10 months 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...
ESA
1998
Springer
15 years 2 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...