9842 search results - page 105 / 1969 » The Complexity of the Matching-Cut Problem |
158
Voted
AAAI
2012
13 years 5 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
117
click to vote
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
141
click to vote
IJCAI
2007
15 years 4 months ago
2007
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
118
click to vote
ECCC
2006
15 years 3 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
124
click to vote
AAAI
1993
15 years 4 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...