Sciweavers

452 search results - page 11 / 91
» Finding bugs is easy
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 5 months ago
Optimal Auctions with Correlated Bidders are Easy
We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there...
Shahar Dobzinski, Hu Fu, Robert Kleinberg
AAAI
2006
13 years 9 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
13 years 9 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
OSDI
2002
ACM
14 years 8 months ago
CMC: A Pragmatic Approach to Model Checking Real Code
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
Madanlal Musuvathi, David Y. W. Park, Andy Chou, D...
ECOOPWEXCEPTION
2006
Springer
13 years 11 months ago
Exception-Handling Bugs in Java and a Language Extension to Avoid Them
It is difficult to write programs that behave correctly in the presence of exceptions. We describe a dataflow analysis for finding a certain class of mistakes made while programs h...
Westley Weimer