Sciweavers

31 search results - page 2 / 7
» Identifying Enumeration Types Modeled with Symbolic Constant...
Sort
View
CP
2009
Springer
14 years 6 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
SARA
2009
Springer
14 years 9 days ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 9 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
ADVCS
2010
106views more  ADVCS 2010»
13 years 5 months ago
'What did You Say?' Emergent Communication in a Multi-Agent Spatial Configuration
This paper reports the results of a multi-agent simulation designed to study the emergence and evolution of symbolic communication. The novelty of this model is that it considers s...
Elio Marchione, Mauricio Salgado, Nigel Gilbert
ALT
2003
Springer
14 years 2 months ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles