Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
We study peer-to-peer service networks consisting of autonomous agents who seek and provide services. To fulfill its local needs, an agent attempts to discover and select informa...
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...
— We present in this paper an approach aiming at dynamically adapting a component structure while preserving its behavior and its services. Among the motivations of this kind of ...