Sciweavers

2109 search results - page 149 / 422
» Solving Necklace Constraint Problems
Sort
View
286
Voted
PLDI
2009
ACM
16 years 6 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
161
Voted
ECAI
2004
Springer
15 years 11 months ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
169
Voted
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ECAI
2006
Springer
15 years 9 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
CVPR
2004
IEEE
16 years 8 months ago
Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka