Sciweavers

4451 search results - page 877 / 891
» On Random Ordering Constraints
Sort
View
IJCAI
1989
13 years 9 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
AAAI
2008
13 years 9 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
13 years 9 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
CONCUR
2010
Springer
13 years 9 months ago
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
DIMVA
2009
13 years 9 months ago
A Service Dependency Modeling Framework for Policy-Based Response Enforcement
The use of dynamic access control policies for threat response adapts local response decisions to high level system constraints. However, security policies are often carefully tigh...
Nizar Kheir, Hervé Debar, Fréd&eacut...