This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
— Regulatory networks are complex networks. This paper addresses the challenge of modelling these networks. The Boolean representation is chosen and supported as a representation...
Cristina Costa Santini, Gunnar Tufte, Pauline C. H...
It is a challenging problem to find agents’ rational strategies in bargaining with incomplete information. In this paper we perform a game theoretic analysis of agents’ ratio...
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
Masoud Asadpour, Mohammad Hassan Zokaei Ashtiani, ...
Abstract. Complete tablebases, indicating best moves for every position, exist for chess endgames. There is no doubt that tablebases contain a wealth of knowledge, however, mining ...
Matej Guid, Martin Mozina, Aleksander Sadikov, Iva...