— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
The information management requirements in systems based on Web Service Architecture principles include both the management of large amounts of relatively static services and assoc...
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...
The ability to detect the existence of nonlinear dynamics may facilitate medical diagnostics for identifying, monitoring and predicting transitions from health to sickness. Detecti...