On the practice of branching program boosting

DOI10.1007/3-540-44795-4_12MaRDI QIDQ4797058zbMATH OpenFDO

Authors Tapio Elomaa, Matti Kääriäinen

Publication date 12 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2167/21670133.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Boosting using branching programs
• Branching Programs for Tree Evaluation
• Incremental branching programs
• Incremental Branching Programs
• Branch distance optimization of structured programs
• Improving strong branching by propagation
• Improving strong branching by domain propagation
• scientific article; zbMATH DE number 4172378
• Program boosting: program synthesis via crowd-sourcing
• Time-space tradeoffs for branching programs

Cited in

(4)

• Boosting using branching programs
• On domain-partitioning induction criteria: worst-case bounds for the worst-case based
• Algorithmic Learning Theory
• The difficulty of reduced error pruning of leveled branching programs

Describes a project that uses

Uses Software

• UCI
• C4.5

This page was built for publication: On the practice of branching program boosting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797058)