In this paper we will extend the input-to-state stability (ISS) framework to continuous-time discontinuous dynamical systems (DDS) adopting piecewise smooth ISS Lyapunov functions...
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Background: While biomedical text mining is emerging as an important research area, practical results have proven difficult to achieve. We believe that an important first step tow...
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...