Sciweavers

201 search results - page 31 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
CC
2006
Springer
133views System Software» more  CC 2006»
14 years 11 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx
WETICE
2000
IEEE
15 years 4 months ago
Reducing Software Security Risk through an Integrated Approach
This paper presents joint work by the California Institute of Technology’s Jet Propulsion Laboratory and the University of California at Davis (UC Davis) sponsored by the Nation...
David P. Gilliam, John C. Kelly, Matt Bishop
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...
FCT
2005
Springer
15 years 5 months ago
Leftist Grammars and the Chomsky Hierarchy
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
Tomasz Jurdzinski, Krzysztof Lorys
P2P
2008
IEEE
15 years 6 months ago
Incentives Against Hidden Action in QoS Overlays
Peer-to-peer networks providing QoS-enabled services are sensitive to hidden action situations, where the actions of a server peer are hidden from the peers who receive services f...
Raul Landa, Miguel Rio, David Griffin, Richard G. ...