9842 search results - page 53 / 1969 » The Complexity of the Matching-Cut Problem |
CORR
1998
Springer
13 years 7 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
GECCO
1999
Springer
13 years 12 months ago
1999
Springer
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
ECCC
2008
13 years 7 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...