Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Abstract. Localization is a complex process based on translation and adaptation of software features. Usually localization progress is identified with the number of translated reso...