920 search results - page 117 / 184 » Generating Satisfiable Problem Instances |
122
Voted
IJCNN
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
112
Voted
PRDC
2006
IEEE
15 years 6 months ago
2006
IEEE
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
115
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
78
Voted
AAAI
2006
15 years 2 months ago
2006
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
101
Voted
RECSYS
2010
ACM
15 years 27 days ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...