— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Abstract— Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growi...