Sciweavers

5326 search results - page 83 / 1066
» On what we can ensure
Sort
View
SUTC
2006
IEEE
16 years 8 days ago
The Computational Complexity of Enforceability Validation for Generic Access Control Rules
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
Vincent C. Hu, D. Richard Kuhn, David F. Ferraiolo
IAT
2005
IEEE
15 years 12 months ago
Automatic Generation of Self-controlled Autonomous Agents
Being able to trust in a system behavior is of prime importance, particularly within the context of critical applications as embedded or real-time systems. We want to ensure that ...
Caroline Chopinaud, Amal El Fallah-Seghrouchni, Pa...
PPSN
2004
Springer
15 years 11 months ago
Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
Jano I. van Hemert, Johannes A. La Poutré
WDAG
2000
Springer
111views Algorithms» more  WDAG 2000»
15 years 9 months ago
Thrifty Generic Broadcast
Weconsider the problemof generic broadcast in asynchronous systems with crashes, a problem that was rst studied in 12]. Roughly speaking, given a \con ict" relation on the set...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
ICCS
2009
Springer
16 years 25 days ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...