Sciweavers

2861 search results - page 437 / 573
» Constraint Programming
Sort
View
ICASSP
2009
IEEE
15 years 1 months ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann
FMCO
2004
Springer
123views Formal Methods» more  FMCO 2004»
15 years 1 months ago
rCOS: Refinement of Component and Object Systems
Abstract. We present a model of object-oriented and component-based refinement. For object-orientation, the model is class-based and refinement is about correct changes in the stru...
Zhiming Liu, Jifeng He, Xiaoshan Li
CP
2006
Springer
15 years 1 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
CP
2006
Springer
15 years 1 months ago
High-Level Nondeterministic Abstractions in
el Nondeterministic Abstractions in C++ Laurent Michel1 , Andrew See1 , and Pascal Van Hentenryck2 1 University of Connecticut, Storrs, CT 06269-2155 2 Brown University, Box 1910, ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
ESORICS
2006
Springer
15 years 1 months ago
A Formal Model of Access Control for Mobile Interactive Devices
Abstract. This paper presents an access control model for programming applications in which the access control to resources can employ user interaction to obtain the necessary perm...
Frédéric Besson, Guillaume Dufay, Th...