9842 search results - page 440 / 1969 » The Complexity of the Matching-Cut Problem |
185
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
208
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
135
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
172
click to vote
ICAS
2009
IEEE
15 years 10 months ago
2009
IEEE
The increased complexity of today's distributed, composite, Web-based systems presents difficult and unique systems management problems. The way these systems interact, and th...
182
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
This paper reports on an on-going project to investigate techniques to diagnose complex dynamical systems that are modeled as hybrid systems. In particular, we examine continuous s...