Sciweavers

297 search results - page 3 / 60
» J-MADeM, a market-based model for complex decision problems
Sort
View
CP
1998
Springer
13 years 9 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
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...
Stephan Pontow
ICLP
2001
Springer
13 years 10 months ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski
DAC
2000
ACM
14 years 6 months ago
Dynamic power management of complex systems using generalized stochastic Petri nets
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
Qinru Qiu, Qing Wu, Massoud Pedram
JCP
2007
120views more  JCP 2007»
13 years 5 months ago
Application of Multi-Attribute Decision Making Approach to Learning Management Systems Evaluation
—The article presents an approach to the development of multi-attribute decision making model that is based on DEX, an expert system shell for multi-attribute decision support. W...
Tanja Arh, Borka Jerman-Blazic
IJCAI
2001
13 years 7 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen