Sciweavers

1224 search results - page 52 / 245
» Theory decision by decomposition
Sort
View
ICALP
2010
Springer
13 years 10 months ago
Towards a Theory of Time-Bounded Verification
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
Joël Ouaknine, James Worrell
MANSCI
2010
92views more  MANSCI 2010»
13 years 8 months ago
A Quantitative Measurement of Regret Theory
This paper introduces a choice-based method that for the first time makes it possible to quantitatively measure regret theory, one of the most popular models of decision under unc...
Han Bleichrodt, Alessandra Cillo, Enrico Diecidue
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 7 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
INFOCOM
1997
IEEE
14 years 2 months ago
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and ...
Roch Guérin, Ariel Orda
ATAL
2003
Springer
14 years 3 months ago
Argumentation based decision making for autonomous agents
This paper presents an argumentation based framework to support the decision making of an agent within a modular architecture for agents. The proposed argumentation framework is d...
Antonis C. Kakas, Pavlos Moraitis