1977 search results - page 41 / 396 » The satisfactory partition problem |
174
click to vote
RTCSA
2005
IEEE
15 years 11 months ago
2005
IEEE
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
131
click to vote
CPAIOR
2007
Springer
16 years 5 days ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
150
click to vote
FMCAD
2004
Springer
15 years 9 months ago
2004
Springer
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
170
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
200
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...