62 search results - page 4 / 13 » Cardinality Networks: a theoretical and empirical study |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
PPSN
1998
Springer
13 years 11 months ago
1998
Springer
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
ML
2006
ACM
13 years 7 months ago
2006
ACM
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
PAKDD
2009
ACM
14 years 2 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
PAKDD
2009
ACM
14 years 4 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...