2593 search results - page 460 / 519 » On Two Problems of Nano-PLA Design |
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
ICLP
2003
Springer
15 years 4 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
ICSE
2003
IEEE-ACM
15 years 4 months ago
2003
IEEE-ACM
Software-intensive systems often exhibit dimensions in size and complexity that exceed the scope of comprehension of even talented, experienced system designers and analysts. With ...
107
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper defines a new type of 3D curves, which can be utilized for curv...
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
The problem of total participation in asynchronous meetings convened with distributed group support systems has been noted frequently but investigated rarely. This paper describes...