Sciweavers

1837 search results - page 47 / 368
» Abstraction and the C Machine Model
Sort
View
RP
2010
Springer
126views Control Systems» more  RP 2010»
13 years 7 months ago
Lossy Counter Machines Decidability Cheat Sheet
Abstract. Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically ...
Philippe Schnoebelen
ATAL
2009
Springer
14 years 3 months ago
Using opponent models for efficient negotiation
d Abstract) Koen Hindriks Man-Machine Interaction Group Delft University of Technology Mekelweg 4, Delft, The Netherlands
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...
ICANN
2005
Springer
14 years 2 months ago
Smooth Bayesian Kernel Machines
Abstract. In this paper, we consider the possibility of obtaining a kernel machine that is sparse in feature space and smooth in output space. Smooth in output space implies that t...
Rutger W. ter Borg, Léon J. M. Rothkrantz
CSL
2008
Springer
13 years 10 months ago
Extensional Uniformity for Boolean Circuits
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
Pierre McKenzie, Michael Thomas, Heribert Vollmer
SACMAT
2005
ACM
14 years 2 months ago
Composing and combining policies under the policy machine
As a major component of any host, or network operating system, access control mechanisms come in a wide variety of forms, each with their individual attributes, functions, methods...
David F. Ferraiolo, Serban I. Gavrila, Vincent C. ...