9842 search results - page 15 / 1969 » The Complexity of the Matching-Cut Problem |
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
IGPL
2011
13 years 2 months ago
2011
This paper presents J-MADeM, a multi-modal decision making mechanism to provide agents in a Multi-Agent Systems (MAS) with a market-based model for complex decision problems. J-MA...
ICMAS
2000
13 years 8 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
ALGORITHMICA
2007
13 years 7 months ago
2007
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
ECCC
2011
13 years 2 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...