9842 search results - page 227 / 1969 » The Complexity of the Matching-Cut Problem |
COLT
2000
Springer
14 years 3 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
LPAR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
ICTAI
2003
IEEE
14 years 4 months ago
2003
IEEE
Coalition formation has become a key topic in multiagent research. In this paper, we propose a preliminary classification for the coalition formation problem based on three drivin...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...