Sciweavers

14078 search results - page 1973 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
CONCUR
2005
Springer
16 years 1 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
16 years 1 months ago
Constant generation for the financial domain using grammatical evolution
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
Ian Dempsey
ICALP
2005
Springer
16 years 1 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
ICNC
2005
Springer
16 years 1 months ago
Using SOFM to Improve Web Site Text Content
We introduce a new method to improve web site text content by identifying the most relevant free text in the web pages. In order to understand the variations in web page text, we c...
Sebastián A. Ríos, Juan D. Vel&aacut...
ICTAC
2005
Springer
16 years 1 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang
« Prev « First page 1973 / 2816 Last » Next »