2354 search results - page 132 / 471 » Assignment Problems |
114
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
122
click to vote
GPEM
2008
15 years 2 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
114
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
: There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This pa...
109
Voted
HICSS
1998
IEEE
15 years 6 months ago
1998
IEEE
Agreement is an important concept in group interaction, both for computermediated and face-to-face groups. This paper presents a measure of disagreement, D, for groups facing limi...
186
click to vote
MFCS
2010
Springer
15 years 23 days ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...