9842 search results - page 1282 / 1969 » The Complexity of the Matching-Cut Problem |
149
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
Coming up with a plan for a team that operates in a non-deterministic environment is a complex process, and the problem is further complicated by the need for team members to comm...
206
click to vote
CPAIOR
2009
Springer
16 years 2 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
188
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
191
click to vote
PKDD
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Inverse reinforcement learning addresses the general problem of recovering a reward function from samples of a policy provided by an expert/demonstrator. In this paper, w...
199
click to vote
PPDP
2009
Springer
16 years 2 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...