Sciweavers

566 search results - page 76 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
105
Voted
ISSTA
2010
ACM
15 years 4 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
DAC
2007
ACM
16 years 1 months ago
Fast Min-Cost Buffer Insertion under Process Variations
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
Ruiming Chen, Hai Zhou
86
Voted
IROS
2006
IEEE
88views Robotics» more  IROS 2006»
15 years 6 months ago
Reliability-Based Design Optimization of Robotic System Dynamic Performance
In this investigation a robotic system’s dynamic performance is optimized for high reliability under uncertainty. The dynamic capability equations allow designers to predict the...
Alan P. Bowling, John E. Renaud, Jeremy T. Newkirk...
81
Voted
CP
2007
Springer
15 years 6 months ago
Groupoids and Conditional Symmetry
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...
Ian P. Gent, Tom Kelsey, S. A. Linton, J. Pearson,...
IAT
2006
IEEE
15 years 6 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler