370 search results - page 26 / 74 » Independent Sets with Domination Constraints |
112
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
121
click to vote
ICA
2007
Springer
15 years 5 months ago
2007
Springer
Independent Component Analysis (ICA) is a statistical method for expressing an observed set of random vectors as a linear combination of statistically independent components. This...
134
Voted
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 6 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
112
Voted
NIPS
2007
15 years 3 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
132
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...