Sciweavers

551 search results - page 60 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
SEMWEB
2010
Springer
14 years 9 months ago
OWL-POLAR: Semantic Policies for Agent Reasoning
Abstract. Policies are declarations of constraints on the behaviour of components within distributed systems, and are often used to capture norms within agent-based systems. A few ...
Murat Sensoy, Timothy J. Norman, Wamberto Weber Va...
ERSA
2009
109views Hardware» more  ERSA 2009»
14 years 9 months ago
An Implementation of Security Extensions for Data Integrity and Confidentiality in Soft-Core Processors
An increasing number of embedded system solutions in space, military, and consumer electronics applications rely on processor cores inside reconfigurable logic devices. Ensuring da...
Austin Rogers, Aleksandar Milenkovic
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 9 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 12 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
ISQED
2005
IEEE
140views Hardware» more  ISQED 2005»
15 years 5 months ago
Toward Quality EDA Tools and Tool Flows Through High-Performance Computing
As the scale and complexity of VLSI circuits increase, Electronic Design Automation (EDA) tools become much more sophisticated and are held to increasing standards of quality. New...
Aaron N. Ng, Igor L. Markov