Sciweavers

669 search results - page 15 / 134
» New Constraint Programming Approaches for the Computation of...
Sort
View
IRI
2006
IEEE
14 years 2 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
ISSTA
2010
ACM
14 years 9 days 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
CVPR
2006
IEEE
14 years 10 months ago
Reconstruction with Interval Constraints Propagation
In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account...
Michela Farenzena, Andrea Fusiello, Agostino Dovie...
EPS
1995
Springer
13 years 12 months ago
A Survey of Constraint Handling Techniques in Evolutionary Computation Methods
One of the major components of any evolutionary system is the evaluation function. Evaluation functions are used to assign a quality measure for individuals in a population. Where...
Zbigniew Michalewicz
CP
2009
Springer
14 years 9 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck