52 search results - page 9 / 11 » Complexity and Approximation of Satisfactory Partition Probl... |
100
click to vote
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
ICML
2004
IEEE
16 years 12 days ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
119
click to vote
AAAI
2010
15 years 1 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
SIGMOD
2001
ACM
15 years 11 months ago
2001
ACM
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
EMSOFT
2009
Springer
15 years 6 months ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...