On the influence of the variable ordering for algorithmic learning using OBDDs

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@Article{KRAUSE2005160,

• author = "Matthias Krause and Petr Savicky and Ingo Wegener",
• title = "On the influence of the variable ordering for algorithmic learning using {OBDDs}",
• journal = "Information and Computation",
• year = "2005",
• volume = "201",
• number = "2",
• pages = "160--177",
• month = "15 " # sep,
• keywords = "genetic algorithms, genetic programming, DSA, IP",
• ISSN = "0890-5401",
• URL = "http://www.sciencedirect.com/science/article/pii/S0890540105001033",
• DOI = "doi:10.1016/j.ic.2005.05.004",
• size = "18 pages",
• abstract = "OBDDs with a fixed variable ordering are used successfully as data structure in experiments with learning heuristics based on examples. In this paper, it is shown that, for some functions, it is necessary to develop an algorithm to learn also a good OBDD variable ordering. There are functions with the following properties. They have OBDDs of linear size for optimal variable orderings. But for all but a small fraction of all variable orderings one needs large size to represent a list of randomly chosen examples. These properties are shown for simple functions like the multiplexer and the inner product.",

}

Genetic Programming entries for Matthias Krause Petr Savicky Ingo Wegener

Citations