Sciweavers

8228 search results - page 1391 / 1646
» Structural Logical Relations
Sort
View
AUSAI
2005
Springer
15 years 6 months ago
Global Versus Local Constructive Function Approximation for On-Line Reinforcement Learning
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
Peter Vamplew, Robert Ollington
119
Voted
CAISE
2005
Springer
15 years 6 months ago
Integrating Unnormalised Semi-structured Data Sources
From Proc. CAiSE05 LNCS 3520, Pages 460-474 c Springer-Verlag 2005 Semi-structured data sources, such as XML, HTML or CSV files, present special problems when performing data int...
Sasivimol Kittivoravitkul, Peter McBrien
CHARME
2005
Springer
143views Hardware» more  CHARME 2005»
15 years 6 months ago
Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
Gianfranco Ciardo, Andy Jinqing Yu
93
Voted
CISC
2005
Springer
116views Cryptology» more  CISC 2005»
15 years 6 months ago
Specifying Authentication Using Signal Events in CSP
The formal analysis of cryptographic protocols has developed into a comprehensive body of knowledge, building on a wide variety of formalisms and treating a diverse range of securi...
Siraj A. Shaikh, Vicky J. Bush, Steve A. Schneider
145
Voted
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
15 years 6 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
« Prev « First page 1391 / 1646 Last » Next »