465 search results - page 35 / 93 » On the Hardness of Range Assignment Problems |
AAAI
2010
15 years 1 months ago
2010
We discuss challenges and opportunities for developing generalized task markets where human and machine intelligence are enlisted to solve problems, based on a consideration of th...
AAAI
1994
15 years 1 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
INCDM
2007
Springer
15 years 6 months ago
2007
Springer
For difficult prediction problems, practitioners often segment the data into relatively homogenous groups and then build a model for each group. This two-step procedure usually res...
ICARCV
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we study the problem of stabilizing a linear time-invariant discrete-time system with information constraints in the input channels. The information constraint in...
NIPS
2003
15 years 1 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...