1581 search results - page 271 / 317 » Domain semantics of possibility computations |
CP
1999
Springer
14 years 2 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
IDA
1999
Springer
14 years 2 months ago
1999
Springer
The goal of input-output modeling is to apply a test input to a system, analyze the results, and learn something useful from the causeeffect pair. Any automated modeling tool that...
CIA
2006
Springer
14 years 1 months ago
2006
Springer
We present a hybrid algorithm for distributed task allocation problem in a cooperative logistics domain. Our approach aims to achieve superior computational performance by combinin...
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
SEBD
2007
13 years 11 months ago
2007
In the last few years, we have been witnessing an evergrowing need for continuous observation and monitoring applications. This need is driven by recent technological advances that...