Sciweavers

2911 search results - page 56 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
TACS
2001
Springer
15 years 10 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz
INFOCOM
1997
IEEE
15 years 10 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
CDC
2009
IEEE
120views Control Systems» more  CDC 2009»
15 years 9 months ago
MIMO experiment design based on asymptotic model order theory
Abstract— In this paper we investigate the problem of designing an input signal for a Multi-Input Multi-Output plant to minimize a control-oriented criterion. By employing Ljungâ...
Cristian R. Rojas, Håkan Hjalmarsson, Roland...
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 6 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
SACMAT
2009
ACM
16 years 20 days ago
Access control policy combining: theory meets practice
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
Ninghui Li, Qihua Wang, Wahbeh H. Qardaji, Elisa B...