Sciweavers

336 search results - page 11 / 68
» Permutation Problems and Channelling Constraints
Sort
View
CP
2003
Springer
14 years 21 days ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
TASE
2008
IEEE
14 years 1 months ago
Reasoning about Channel Passing in Choreography
Abstract Web services choreography describes global models of service interactions among a set of participants. For an interaction to be executed, the participants taken part in it...
Hongli Yang, Chao Cai, Liyang Peng, Xiangpeng Zhao...
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
SCP
2011
228views Communications» more  SCP 2011»
13 years 2 months ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen