307 search results - page 19 / 62 » Finite locally-quasiprimitive graphs |
CASES
2010
ACM
13 years 6 months ago
2010
ACM
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
AHS
2006
IEEE
14 years 1 months ago
2006
IEEE
Sharing Intellectual Property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach...
IJAC
2008
13 years 10 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
EUROGP
2007
Springer
14 years 4 months ago
2007
Springer
This paper reports on the results of a preliminary study conducted to evaluate genetic programming (GP) as a means of evolving finite state transducers. A genetic programming syste...