Sciweavers

2864 search results - page 437 / 573
» Constraint Programming in OPL
Sort
View
ICASSP
2009
IEEE
14 years 25 days 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
CODES
2004
IEEE
14 years 21 days ago
Automatic synthesis of system on chip multiprocessor architectures for process networks
In this paper, we present an approach for automatic synthesis of System on Chip (SoC) multiprocessor architectures for applications expressed as process networks. Our approach is ...
Basant Kumar Dwivedi, Anshul Kumar, M. Balakrishna...
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
14 years 21 days ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba
FMCO
2004
Springer
123views Formal Methods» more  FMCO 2004»
14 years 21 days 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
14 years 21 days 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