This talk consists of two interwoven stories. The Happy Story presents a technical solution to the problem of optimizing for cost instead of the more normal metric of duration. We describe a mechanism whereby the optimization problem is split into an evaluation component, where the projected cost of a schedule is evaluated using dynamic programming techniques, and a search component, where search is conducted in "window space" to find a cost-efficient schedule. The Sad Story explains what happens when you build a better mousetrap. The people beating a path to your door are the fat cats, who are reimbursed for their mouse catching on a cost-plus basis. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ginsberg, M. (2007). Of mousetraps and men: A cautionary tale. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, p. 2). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_2
Mendeley helps you to discover research relevant for your work.