confined in hardware constrained computing devices. RAM is the most limiting factor in this context. This paper gives a thorough analysis of the RAM consumption problem and makes the following contributions. First, it proposes a query execution model that reaches a lower bound in terms of RAM

confined in hardware constrained computing devices. RAM is the most limiting factor in this context. This paper gives a thorough analysis of the RAM consumption problem and makes the following contributions. First, it proposes a query execution model that reaches a lower bound in terms of RAM consumption

are socially and ecologically constrained, and, at the same time, biologically and culturally able of innovation. Meaning is produced, reproduced, and fought over in all layers of social structure, in production as in consumption, in experience as in power. What makes sense to anyone is de ned by the endless

requirements. If the requirements exceed the number of registers available in the target architecture, some steps need to be applied to reduce the register pressure (incurring some performance degradation): reduce iteration overlapping or spilling some lifetimes to memory. In the first part of this paper, we

and backchase

We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay

computations, betweenness cen-trality, and reachability querying require the execution of many such graph traversals. Typically, these traversals are independent of one another and can thus be executed in parallel. This paper presents multi-search, a simple abstraction that is designed for graph algorithms

architecture that can be easily tailored for devices with a wide range of resources, allowing resource-constrained devices to provide services while leveraging the capabilities of more powerful devices. Servilla has been implemented on TinyOS for two representative hardware platforms (Imote2 and Telos

In modern architectures based on Web Services or Cloud Computing, a very large number of user requests arrive concurrently and has to be scheduled for execution constrained by correctness criteria, service-level agreements etc. The state of the art is to develop hand-coded schedulers, though

are client-server based, which is feasible for relatively slow role-playing games. Those have modest bandwidth and latency requirements and are paid for by their customers. For MMOGs with higher realtime requirements and/or a smaller number of customers willing to pay, peer-to-peer networking seems to be a