We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a ge...
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
Research has shown that students’ problem-solving actions vary in type and duration. Among other causes, this behavior is a result of strategies that are driven by different goal...
Ido Roll, Ryan Shaun Baker, Vincent Aleven, Kennet...
We explore strategies to resolve conflicts in multiagent environments that arise when agents compete for resources they need for survival and procreation. As expected, social str...
This paper presents protocols and strategies for coalition formation with incomplete information under time constraints. It focuses on strategies for coalition members to distribu...
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
The ability to model changes in preferences is crucially important for sound decision making and effective communication. Much has been written about strategies for changing belie...
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...