9842 search results - page 250 / 1969 » The Complexity of the Matching-Cut Problem |
164
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
209
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
168
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
191
click to vote
MATES
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Taxonomies in the area of Multi-Agent Systems (MAS) classify problems according to the underlying principles and assumptions of the agents’ abilities, rationality and i...
195
click to vote
AAAI
2008
15 years 9 months ago
2008
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...