1968 search results - page 47 / 394 » The Complexity of Valued Constraint Models |
103
click to vote
SARA
2009
Springer
15 years 8 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
JANCL
2006
15 years 1 months ago
2006
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
108
click to vote
CEEMAS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
116
click to vote
IJCV
2000
15 years 1 months ago
2000
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
110
click to vote
DGO
2008
15 years 2 months ago
2008
Supporting public participation is often a key goal in the design of digital government systems. However, years of work may be required before a complex system, such as the UrbanS...