6562 search results - page 327 / 1313 » Noetherianity and Combination Problems |
206
click to vote
ICDCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
177
click to vote
ER
1999
Springer
15 years 11 months ago
1999
Springer
“A pattern ... describes a problem which occurs over and over again in our environment, and then describes the core of the solution to that problem, in such a way that you can us...
186
click to vote
VLDB
1997
ACM
15 years 11 months ago
1997
ACM
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
183
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
180
click to vote
AMT
2006
Springer
15 years 10 months ago
2006
Springer
Text classification using positive and unlabeled data refers to the problem of building text classifier using positive documents (P) of one class and unlabeled documents (U) of man...