1355 search results - page 94 / 271 » Alternating Timed Automata over Bounded Time |
NJC
2000
13 years 8 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
FPL
2006
Springer
14 years 21 days ago
2006
Springer
This paper is concerned with the application of formal optimisation methods to the design of mixed-granularity FPGAs. In particular, we investigate the appropriate mix and floorpl...
ICC
2011
IEEE
12 years 8 months ago
2011
IEEE
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
ASIACRYPT
2004
Springer
14 years 2 months ago
2004
Springer
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compr...