Sciweavers

1451 search results - page 198 / 291
» Order independence and rationalizability
Sort
View
CADE
2004
Springer
15 years 11 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
CHES
2004
Springer
121views Cryptology» more  CHES 2004»
15 years 11 months ago
Improving the Security of Dual-Rail Circuits
Dual-rail encoding, return-to-spacer protocol and hazard-free logic can be used to resist differential power analysis attacks by making the power consumption independent of process...
Danil Sokolov, Julian Murphy, Alexandre V. Bystrov...
HSNMC
2004
Springer
106views Multimedia» more  HSNMC 2004»
15 years 11 months ago
Performance Evaluation of a Probabilistic Packet Filter Optimization Algorithm for High-Speed Network Monitoring
Because of the ever-increasing popularity of the Internet, network monitoring becomes very mission critical to guarantee the operation of IP networks, e.g. to detect network failur...
Jan Coppens, Stijn De Smet, Steven Van den Berghe,...
ISOLA
2004
Springer
15 years 11 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
JIT
2004
Springer
123views Database» more  JIT 2004»
15 years 11 months ago
Listening to Agents - Transparent Representation and Presentation of Agent Communication in Mobile Systems
In the research domain agent-based systems are widely used for mobile and distributed information systems. Their underlying paradigm provides excellent mechanisms to isolate tasks ...
Matthias Jöst, Matthias Merdes, Rainer Malaka