4066 search results - page 226 / 814 » Almost Complete Sets |
132
click to vote
MLQ
2006
15 years 6 months ago
2006
We define the concept of a logic frame, which extends the concept stract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the...
152
click to vote
JCT
2007
15 years 6 months ago
2007
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
173
click to vote
EJC
2008
15 years 5 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
194
click to vote
ISW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Instruction Set Randomization (ISR) is a promising technique for preventing code-injection attacks. In this paper we present a complete randomization framework for JavaSc...
181
click to vote
ARC
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. In this paper, we take a MIPS-based open-source uniprocessor soft core, Plasma, and extend it to obtain the Beefarm infrastructure for FPGA-based multiprocessor emulation...