Sciweavers

3946 search results - page 492 / 790
» The computational complexity of choice sets
Sort
View
ECAL
1999
Springer
15 years 11 months ago
Arithmetic Operations on Self-Replicating Cellular Automata
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
Enrico Petraglio, Jean-Marc Henry, Gianluca Tempes...
EUROMICRO
1998
IEEE
15 years 11 months ago
Design Correctness of Digital Systems
Transformational design is aformal technique directed at design correctness. It integrates design and veriJication by the use of pre-proven behaviour preserving transformations as...
Corrie Huijs
MINAR
1998
Springer
113views Multimedia» more  MINAR 1998»
15 years 11 months ago
Envelope Parameter Calculation of Similarity Indexing Structure
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
Xuesheng Bai, Guangyou Xu, Yuanchun Shi
ICLP
1997
Springer
15 years 11 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian
AADEBUG
1993
Springer
15 years 11 months ago
Slicing Programs with Arbitrary Control-flow
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
Thomas Ball, Susan Horwitz