982 search results - page 181 / 197 » Solving Steiner tree problems in graphs to optimality |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
IVC
2007
13 years 7 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
FC
2009
Springer
14 years 2 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...