Sciweavers

11740 search results - page 2190 / 2348
» More Problems in Rewriting
Sort
View
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
14 years 3 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
DAGM
2003
Springer
14 years 3 months ago
Learning Human-Like Opponent Behavior for Interactive Computer Games
Compared to their ancestors in the early 1970s, present day computer games are of incredible complexity and show magnificent graphical performance. However, in programming intelli...
Christian Bauckhage, Christian Thurau, Gerhard Sag...
EUROPAR
2003
Springer
14 years 3 months ago
KOJAK - A Tool Set for Automatic Performance Analysis of Parallel Programs
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
Bernd Mohr, Felix Wolf
FSTTCS
2003
Springer
14 years 3 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 3 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
« Prev « First page 2190 / 2348 Last » Next »