4695 search results - page 817 / 939 » Software Clustering Techniques and the Use of Combined Algor... |
174
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, ...
177
click to vote
AAAI
2000
15 years 7 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
176
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
168
click to vote
IJON
2006
15 years 6 months ago
2006
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
175
click to vote
ICGA
2007
15 years 6 months ago
2007
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...