Login / Signup
Polynomial-Time Optimal Pretty-Printing Combinators with Choice.
Anton Podkopaev
Dmitri Boulytchev
Published in:
Ershov Memorial Conference (2014)
Keyphrases
</>
worst case
optimal solution
high speed
dynamic programming
artificial intelligence
optimal design
feature selection
low cost
artificial neural networks
optimal planning
pareto optimal
special case
search space
data mining
multi agent
reinforcement learning
decision trees
social networks
genetic algorithm