Sciweavers

141 search results - page 26 / 29
» State dependent computation using coupled recurrent networks
Sort
View
LCTRTS
2005
Springer
15 years 3 months ago
Efficient application migration under compiler guidance
Mobile computing based upon wireless technology as the interconnect and PDAs, Web-enabled cell phones etc. as the end devices provide a rich infrastructure for anywhere, anytime i...
Kun Zhang, Santosh Pande
IANDC
2006
121views more  IANDC 2006»
14 years 10 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
AI
2011
Springer
14 years 5 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
HPDC
1999
IEEE
15 years 2 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
DISCEX
2003
IEEE
15 years 3 months ago
Willow System Demonstration
Dealing with damage that arises during operation of networked information systems is essential if such systems are to provide the dependability required by modern critical applica...
John C. Knight, Jonathan Hill, Philip E. Varner, P...