The global information service in the Internet is a heterogeneous and rapidly evolving environment. Constantly, new information services are added, others are modified, removed or...
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...