Sciweavers

843 search results - page 115 / 169
» Introducing the Iteration in sPBC
Sort
View
POPL
2009
ACM
16 years 6 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
ISSTA
2009
ACM
16 years 15 days ago
Loop-extended symbolic execution on binary programs
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
Prateek Saxena, Pongsin Poosankam, Stephen McCaman...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 5 days ago
SDR: a better trigger for adaptive variance scaling in normal EDAs
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...
Peter A. N. Bosman, Jörn Grahl, Franz Rothlau...
UIST
2006
ACM
15 years 12 months ago
Reflective physical prototyping through integrated design, test, and analysis
Prototyping is the pivotal activity that structures innovation, collaboration, and creativity in design. Prototypes embody design hypotheses and enable designers to test them. Fra...
Björn Hartmann, Scott R. Klemmer, Michael Ber...
COLT
2005
Springer
15 years 11 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon