2934 search results - page 193 / 587 » Universality in Multi-Agent Systems |
153
click to vote
ISPDC
2005
IEEE
16 years 2 days ago
2005
IEEE
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
166
click to vote
APAL
2007
15 years 6 months ago
2007
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
166
click to vote
GRC
2007
IEEE
16 years 24 days ago
2007
IEEE
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
181
click to vote
TPHOL
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
147
click to vote
CONCUR
2005
Springer
16 years 18 hour ago
2005
Springer
d Abstract) Adrian Francalanza and Matthew Hennessy University of Sussex, Falmer Brighton BN1 9RH, England Abstract. We develop a behavioural theory of distributed programs in the ...