543 search results - page 105 / 109 » A Multiagent Algorithm for Graph Partitioning |
128
click to vote
AAAI
2008
15 years 4 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
136
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
142
click to vote
ASPDAC
2010
ACM
15 years 15 hour ago
2010
ACM
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
128
click to vote
PVLDB
2008
15 years 1 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
103
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...