Sciweavers

2917 search results - page 47 / 584
» Satisfying Interaction Constraints
Sort
View
AI
2007
Springer
13 years 9 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
ADCM
2008
76views more  ADCM 2008»
13 years 9 months ago
A multivariate Powell-Sabin interpolant
We consider the problem of constructing a C1 piecewise quadratic interpolant, Q, to positional and gradient data defined at the vertices of a tessellation of n-simplices in IRn . T...
Tatyana Sorokina, Andrew J. Worsey
TON
2002
83views more  TON 2002»
13 years 8 months ago
Heuristic algorithms for multiconstrained quality-of-service routing
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristic...
Xin Yuan
CP
2006
Springer
13 years 10 months ago
Graph Properties Based Filtering
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey...
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 9 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann