Sciweavers

595 search results - page 31 / 119
» Little languages: little maintenance
Sort
View
CP
2005
Springer
14 years 2 months ago
SPREAD: A Balancing Constraint Based on Statistics
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
Gilles Pesant, Jean-Charles Régin
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
14 years 2 months ago
Evolving recurrent models using linear GP
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
Xiao Luo, Malcolm I. Heywood, A. Nur Zincir-Heywoo...
STACS
2005
Springer
14 years 2 months ago
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
Victor Poupet
SEFM
2003
IEEE
14 years 2 months ago
Architecting Specifications for Test Case Generation
The Specification and Description Language (SDL) together with its associated tool sets can be used for the generation of Tree and Tabular Combined Notation (TTCN) test cases. Sur...
Richard O. Sinnott
WETICE
2003
IEEE
14 years 2 months ago
Policy Storage for Role-Based Access Control Systems
Role-based access control has been a focal area for many security researchers over the last decade. There have been a large number of models, and many rich specification language...
András Belokosztolszki, David M. Eyers, Wei...