Sciweavers

166 search results - page 8 / 34
» Comparison of two approaches to approximated reasoning
Sort
View
PLDI
2012
ACM
11 years 10 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...
ICADL
2003
Springer
149views Education» more  ICADL 2003»
14 years 1 months ago
Approximating Fair Use in LicenseScript
Current rights management systems are not able to enforce copyright laws because of both legal and technological reasons. The contract rights granted by a copyright owner are often...
Cheun Ngen Chong, Sandro Etalle, Pieter H. Hartel,...
JELIA
1998
Springer
14 years 3 hour ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
ICML
2009
IEEE
14 years 8 months ago
Constraint relaxation in approximate linear programs
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
Marek Petrik, Shlomo Zilberstein
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 9 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei