Sciweavers

8094 search results - page 160 / 1619
» Improvements in Formula Generalization
Sort
View
ICSE
2007
IEEE-ACM
14 years 9 months ago
GoalDebug: A Spreadsheet Debugger for End Users
We present a spreadsheet debugger targeted at end users. Whenever the computed output of a cell is incorrect, the user can supply an expected value for a cell, which is employed b...
Robin Abraham, Martin Erwig
AI
2001
Springer
14 years 1 months ago
A Case Study for Learning from Imbalanced Data Sets
We present our experience in applying a rule induction technique to an extremely imbalanced pharmaceutical data set. We focus on using a variety of performance measures to evaluate...
Aijun An, Nick Cercone, Xiangji Huang
IPPS
1999
IEEE
14 years 1 months ago
A Performance Model of Speculative Prefetching in Distributed Information Systems
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh
IJCAI
2003
13 years 10 months ago
Efficient Symmetry Breaking for Boolean Satisfiability
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 9 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio