Sciweavers

1224 search results - page 72 / 245
» Theory decision by decomposition
Sort
View
CDC
2010
IEEE
13 years 5 months ago
Preference elicitation in Fully Probabilistic Design of decision strategies
Any systematic decision-making design selects a decision strategy that makes the resulting closed-loop behaviour close to the desired one. Fully Probabilistic Design (FPD) describe...
Miroslav Kárný, Tatiana V. Guy
RAS
1998
81views more  RAS 1998»
13 years 9 months ago
Towards a theory of delegation for agent-based systems
In this paper a theory of delegation is presented. There are at least three reasons for developing such a theory. First, one of the most relevant notions of "agent" is b...
Cristiano Castelfranchi, Rino Falcone
ISOLA
2010
Springer
13 years 8 months ago
Enforcing Applicability of Real-Time Scheduling Theory Feasibility Tests with the Use of Design-Patterns
Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory...
Alain Plantec, Frank Singhoff, Pierre Dissaux, J&e...
ECAI
2010
Springer
13 years 7 months ago
On Computing Backbones of Propositional Theories
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
João Marques-Silva, Mikolás Janota, ...
CADE
2005
Springer
14 years 10 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna