We address several recent developments in non-cooperative as well as evolutionary game theory, that give a new viewpoint to Complex Systems understanding. In particular, we discuss...
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu, Tian...
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...