96 search results - page 4 / 20 » Complexity of Decision Problems for Mixed and Modal Specific... |
CP
1998
Springer
13 years 10 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
LATA
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
IJRR
2010
13 years 4 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
UM
2001
Springer
13 years 10 months ago
2001
Springer
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
IADIS
2003
13 years 7 months ago
2003
Today’s users want to access their data everywhere and any time – in various environments and occasions. The data itself can be very complex – the problem is then in providi...