Sciweavers

1813 search results - page 114 / 363
» Instance Pruning Techniques
Sort
View
APAL
2007
111views more  APAL 2007»
15 years 6 months ago
A coverage construction of the reals and the irrationals
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...
Harold Simmons
IWPC
2009
IEEE
16 years 1 months ago
Standing on the shoulders of giants - A data fusion approach to design pattern detection
Identification of design patterns can deliver important information to designers. Therefore, automated design pattern detection (DPD) is highly desirable when it comes to underst...
Günter Kniesel, Alexander Binun
SAT
2009
Springer
82views Hardware» more  SAT 2009»
16 years 28 days ago
Generalizing Core-Guided Max-SAT
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
Mark H. Liffiton, Karem A. Sakallah
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
15 years 11 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
SAIG
2001
Springer
15 years 10 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann