We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Abstract. This paper presents a new multi-agent physics-based simulation framework (DISCOVERY), supporting experiments with self-organizing underwater sensor and actuator networks....
A network with a logistic-like local dynamics is considered. We implement a mean-field multiplicative coupling among first-neighbor nodes. When the coupling parameter is small, ...
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...