Sciweavers

2340 search results - page 139 / 468
» Second quarter 2008
Sort
View
COMPGEOM
2008
ACM
15 years 8 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
CP
2008
Springer
15 years 8 months ago
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
When numerical CSPs are used to solve systems of n equations with n variables, the preconditioned interval Newton operator plays two key roles: First it allows handling the n equat...
Alexandre Goldsztejn, Laurent Granvilliers
CP
2008
Springer
15 years 8 months ago
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
This paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rul...
Mats Carlsson, Nicolas Beldiceanu, Julien Martin
CP
2008
Springer
15 years 8 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
CPAIOR
2008
Springer
15 years 8 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper