Sciweavers

4744 search results - page 260 / 949
» Connected Computing
Sort
View
CCGRID
2004
IEEE
15 years 7 months ago
Routing and resource discovery in Phoenix Grid-enabled message passing library
We describe design and implementation of a "Gridenabled" message passing library, in the context of Phoenix message passing model. It supports (1) message routing betwee...
Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa
EUROPAR
2006
Springer
15 years 7 months ago
Context Awareness: An Experiment with Hoarding
Abstract. Computer mobility allows people to use computers in varied and changing environments. This variability forces applications to adapt thus requiring awareness of the comput...
João Garcia, Luís Veiga, Paulo Ferre...
ATAL
2008
Springer
15 years 5 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
144
Voted
ADAEUROPE
2007
Springer
15 years 10 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
Johann Blieberger, Bernd Burgstaller, Robert Mitte...
AINTEC
2007
Springer
15 years 10 months ago
Quality-of-Service Multicast Overlay Spanning Tree Algorithms for Wireless Ad Hoc Networks
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
Georgios Rodolakis, Cedric Adjih, Anis Laouiti, Sa...