Sciweavers

12697 search results - page 371 / 2540
» Call for Papers
Sort
View
AAAI
1994
15 years 8 months ago
An Approach to Multiply Segmented Constraint Satisfaction Problems
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
Randall A. Helzerman, Mary P. Harper
ESORICS
2010
Springer
15 years 8 months ago
A Theory of Runtime Enforcement, with Results
This paper presents a theory of runtime enforcement based on mechanism models called MRAs (Mandatory Results Automata). MRAs can monitor and transform security-relevant actions and...
Jay Ligatti, Srikar Reddy
DM
2010
124views more  DM 2010»
15 years 7 months ago
Asymptotic enumeration of 2-covers and line graphs
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
Peter J. Cameron, Thomas Prellberg, Dudley Stark

Publication
285views
15 years 10 months ago
Center of mass encoding: a self-adaptive representation with adjustable redundancy for real-valued parameters
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
Claudio Mattiussi, Peter Dürr, Dario Floreano
SECON
2008
IEEE
16 years 1 months ago
SYNAPSE: A Network Reprogramming Protocol for Wireless Sensor Networks Using Fountain Codes
—Wireless reprogramming is a key functionality in Wireless Sensor Networks (WSNs). In fact, the requirements for the network may change in time, or new parameters might have to b...
Michele Rossi, Giovanni Zanca, Luca Stabellini, Ri...