Sciweavers

2490 search results - page 112 / 498
» Complexity of Contextual Reasoning
Sort
View
CSFW
2011
IEEE
14 years 4 months ago
The Complexity of Quantitative Information Flow Problems
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
SSD
2007
Springer
139views Database» more  SSD 2007»
15 years 10 months ago
Local Topological Relationships for Complex Regions
Topological relationships between spatial objects are important for querying, reasoning, and indexing of data within spatial databases. These relationships are qualitative and resp...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...
ICNP
2005
IEEE
15 years 10 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
KR
2004
Springer
15 years 9 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
TAPSOFT
1997
Springer
15 years 8 months ago
Specifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
Wolfgang May