1968 search results - page 73 / 394 » The Complexity of Valued Constraint Models |
115
click to vote
ENTCS
2007
15 years 1 months ago
2007
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
132
click to vote
EMMCVPR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The complexity of visual representations is substantially limited by the compositional nature of our visual world which, therefore, renders learning structured object mod...
FLAIRS
2003
15 years 2 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
117
click to vote
PODS
2008
ACM
16 years 1 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...