Sciweavers

361 search results - page 73 / 73
» Trade of a problem-solving task
Sort
View
PLDI
2012
ACM
11 years 7 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...