Sciweavers

1290 search results - page 26 / 258
» New algorithms of the Q-learning type
Sort
View
ACTA
2005
92views more  ACTA 2005»
13 years 8 months ago
Type-based information flow analysis for the pi-calculus
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
Naoki Kobayashi
TKDE
1998
142views more  TKDE 1998»
13 years 8 months ago
Performance Analysis of Three Text-Join Algorithms
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
Weiyi Meng, Clement T. Yu, Wei Wang 0010, Naphtali...
ICALP
2000
Springer
14 years 6 days ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
ICPR
2006
IEEE
14 years 9 months ago
Multi-Subset Selection for Keyword Extraction and Other Prototype Search Tasks Using Feature Selection Algorithms
We present a framework that enables the use of traditional feature selection algorithms in a new context - for building a set of subsets of specified properties. During the course...
Pavel Pudil, Petr Somol
COLOGNETWENTE
2010
13 years 7 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak