Sciweavers

62 search results - page 11 / 13
» The Succinct Solver Suite
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 9 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ISSTA
2010
ACM
13 years 11 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 2 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai
LCTRTS
2009
Springer
14 years 2 months ago
Synergistic execution of stream programs on multicores with accelerators
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
Abhishek Udupa, R. Govindarajan, Matthew J. Thazhu...
ICCAD
1997
IEEE
122views Hardware» more  ICCAD 1997»
13 years 11 months ago
Approximate timing analysis of combinational circuits under the XBD0 model
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
Yuji Kukimoto, Wilsin Gosti, Alexander Saldanha, R...