Sciweavers

85 search results - page 6 / 17
» State-transition machines, revisited
Sort
View
MFCS
2010
Springer
13 years 6 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
LISP
2007
45views more  LISP 2007»
13 years 7 months ago
State-transition machines, revisited
David A. Schmidt
CORR
1999
Springer
120views Education» more  CORR 1999»
13 years 7 months ago
A Machine-Independent Debugger--Revisited
Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-leve...
David R. Hanson
ECML
2006
Springer
13 years 11 months ago
Right of Inference: Nearest Rectangle Learning Revisited
In Nearest Rectangle (NR) learning, training instances are generalized into hyperrectangles and a query is classified according to the class of its nearest rectangle. The method ha...
Byron J. Gao, Martin Ester
ICCAD
2007
IEEE
139views Hardware» more  ICCAD 2007»
14 years 4 months ago
Remote activation of ICs for piracy prevention and digital right management
— We introduce a remote activation scheme that aims to protect integrated circuits (IC) intellectual property (IP) against piracy. Remote activation enables designers to lock eac...
Yousra Alkabani, Farinaz Koushanfar, Miodrag Potko...