Sciweavers

1477 search results - page 192 / 296
» Random Convex Programs
Sort
View
PLDI
2010
ACM
14 years 2 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
ASPLOS
2008
ACM
13 years 11 months ago
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
Shan Lu, Soyeon Park, Eunsoo Seo, Yuanyuan Zhou
STACS
2005
Springer
14 years 2 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
ISSTA
2012
ACM
11 years 11 months ago
Swarm testing
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased diversity leads to improved coverage and fault detec...
Alex Groce, Chaoqiang Zhang, Eric Eide, Yang Chen,...
WWW
2009
ACM
14 years 9 months ago
Using static analysis for Ajax intrusion detection
We present a static control-flow analysis for JavaScript programs running in a web browser. Our analysis tackles numerous challenges posed by modern web applications including asy...
Arjun Guha, Shriram Krishnamurthi, Trevor Jim