Sciweavers

2043 search results - page 49 / 409
» A convenient category of domains
Sort
View
PERVASIVE
2006
Springer
14 years 9 months ago
Scalability in a Secure Distributed Proof System
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
Kazuhiro Minami, David Kotz
TCS
2008
14 years 9 months ago
Information systems revisited - the general continuous case
In this paper a new notion of continuous information system is introduced. It is shown that the information systems of this kind generate exactly the continuous domains. The new i...
Dieter Spreen, Luoshan Xu, Xuxin Mao
SYNASC
2006
IEEE
86views Algorithms» more  SYNASC 2006»
15 years 3 months ago
Implementing Parameterized Type Algorithm Definitions in Mathematica
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...
Alina Andreica
ATAL
2008
Springer
14 years 11 months ago
Graph Laplacian based transfer learning in reinforcement learning
The aim of transfer learning is to accelerate learning in related domains. In reinforcement learning, many different features such as a value function and a policy can be transfer...
Yi-Ting Tsao, Ke-Ting Xiao, Von-Wun Soo
EKAW
2004
Springer
15 years 3 months ago
A Hybrid Algorithm for Alignment of Concept Hierarchies
Hierarchical categorization is a powerful and convenient method so that it is commonly used in various areas, such as ontologies. Although each hierarchy is useful, there are probl...
Ryutaro Ichise, Masahiro Hamasaki, Hideaki Takeda