4480 search results - page 14 / 896 » Prototyping Completion with Constraints Using Computational ... |
121
click to vote
ATAL
2011
Springer
13 years 11 months ago
2011
Springer
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
RTA
1993
Springer
15 years 3 months ago
1993
Springer
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
AI
2007
Springer
14 years 12 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
108
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...