10,882 research outputs found
Toward an automaton Constraint for Local Search
We explore the idea of using finite automata to implement new constraints for
local search (this is already a successful technique in constraint-based global
search). We show how it is possible to maintain incrementally the violations of
a constraint and its decision variables from an automaton that describes a
ground checker for that constraint. We establish the practicality of our
approach idea on real-life personnel rostering problems, and show that it is
competitive with the approach of [Pralong, 2007]
On Global Warming (Softening Global Constraints)
We describe soft versions of the global cardinality constraint and the
regular constraint, with efficient filtering algorithms maintaining domain
consistency. For both constraints, the softening is achieved by augmenting the
underlying graph. The softened constraints can be used to extend the
meta-constraint framework for over-constrained problems proposed by Petit,
Regin and Bessiere.Comment: 15 pages, 7 figures. Accepted at the 6th International Workshop on
Preferences and Soft Constraint
Real-time content-aware texturing for deformable surfaces
Animation of models often introduces distortions to their parameterisation, as these are typically optimised for a single frame. The net effect is that under deformation, the mapped features, i.e. UV texture maps, bump maps or displacement maps, may appear to stretch or scale in an undesirable way. Ideally, what we would like is for the appearance of such features to remain feasible given any underlying deformation. In this paper we introduce a real-time technique that reduces such distortions based on a distortion control (rigidity) map. In two versions of our proposed technique, the parameter space is warped in either an axis or a non-axis aligned manner based on the minimisation of a non-linear distortion metric. This in turn is solved using a highly optimised hybrid CPU-GPU strategy. The result is real-time dynamic content-aware texturing that reduces distortions in a controlled way. The technique can be applied to reduce distortions in a variety of scenarios, including reusing a low geometric complexity animated sequence with a multitude of detail maps, dynamic procedurally defined features mapped on deformable geometry and animation authoring previews on texture-mapped models. © 2013 ACM
Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation
Airspace sectorisation provides a partition of a given airspace into sectors,
subject to geometric constraints and workload constraints, so that some cost
metric is minimised. We make a study of the constraints that arise in airspace
sectorisation. For each constraint, we give an analysis of what algorithms and
properties are required under systematic search and stochastic local search
On the Reification of Global Constraints
We introduce a simple idea for deriving reified global constraints in a systematic way. It is based on
the observation that most global constraints can be reformulated as a conjunction of pure functional dependency
constraints together with a constraint that can be easily reified. We first show how the core constraints of the
Global Constraint Catalogue can be reified and we then identify several reification categories that apply to at
least 82% of the constraints in the Global Constraint Catalogue
Matched filters for coalescing binaries detection on massively parallel computers
We discuss some computational problems associated to matched filtering of
experimental signals from gravitational wave interferometric detectors in a
parallel-processing environment. We then specialize our discussion to the use
of the APEmille and apeNEXT processors for this task. Finally, we accurately
estimate the performance of an APEmille system on a computational load
appropriate for the LIGO and VIRGO experiments, and extrapolate our results to
apeNEXT.Comment: 19 pages, 6 figure
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction
This paper introduces the SEQ BIN meta-constraint with a polytime algorithm
achieving general- ized arc-consistency according to some properties. SEQ BIN
can be used for encoding counting con- straints such as CHANGE, SMOOTH or
INCREAS- ING NVALUE. For some of these constraints and some of their variants
GAC can be enforced with a time and space complexity linear in the sum of
domain sizes, which improves or equals the best known results of the
literature
- …