Sciweavers

64 search results - page 5 / 13
» Clarkson's Algorithm for Violator Spaces
Sort
View
SPIN
2000
Springer
13 years 11 months ago
Using Runtime Analysis to Guide Model Checking of Java Programs
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...
Klaus Havelund
VLSID
2006
IEEE
112views VLSI» more  VLSID 2006»
14 years 1 months ago
Handling Constraints in Multi-Objective GA for Embedded System Design
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
Biman Chakraborty, Ting Chen, Tulika Mitra, Abhik ...
AAAI
2004
13 years 9 months ago
Hiding Satisfying Assignments: Two Are Better than One
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
Dimitris Achlioptas, Haixia Jia, Cristopher Moore
DAC
2007
ACM
14 years 8 months ago
Gate Sizing For Cell Library-Based Designs
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
Shiyan Hu, Mahesh Ketkar, Jiang Hu
CGO
2011
IEEE
12 years 11 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...