1772 search results - page 243 / 355 » Classifying Problems into Complexity Classes |
115
click to vote
PATAT
1997
Springer
15 years 6 months ago
1997
Springer
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...
112
Voted
AAAI
2007
15 years 5 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
102
Voted
ECCC
2010
15 years 2 months ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
116
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We propose a max-margin formulation for the multi-label classification problem where the goal is to tag a data point with a set of pre-specified labels. Given a set of L labels, a...
110
Voted
PODS
2001
ACM
16 years 2 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...