1760 search results - page 64 / 352 » Connected Set Cover Problem and Its Applications |
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
CASCON
2007
13 years 10 months ago
2007
Mechanisms such as Java Web Start enable on-thefly downloading and execution of applications installed on remote servers, without the need for having them installed on the local ...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
NMR
2004
Springer
14 years 2 months ago
2004
Springer
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base (KB). This problem is usually referred to as the problem of belief change. The...
SODA
1992
ACM
13 years 10 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...