Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
The problem of partner finding is to identify which entities (agents) can provide requested services from a group of entities. It can be found in open and distributed environment...
In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
This paper concerns the problem of identity management in modern Web-2.0-based mashup applications. Identity management supports convenient access to information when mashups are ...
In online, dynamic environments, the services requested by consumers may not be readily served by the providers. This requires the service consumers and providers to negotiate the...