3172 search results - page 50 / 635 » On the Random-Self-Reducibility of Complete Sets |
176
click to vote
DEXA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Workflow Management Systems (WFMS) coordinate execution of logically related multiple tasks in an organization. A workflow schema is defined using a set of tasks that are...
157
click to vote
AAAI
2010
15 years 7 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
136
click to vote
ACCV
1998
Springer
15 years 10 months ago
1998
Springer
The hypothesis veri cation stage of the traditional image processing approach, consisting of low, medium, and high level processing, will su er if the set of low level features ext...
152
click to vote
IPL
2007
15 years 6 months ago
2007
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
166
click to vote
ORL
2008
15 years 6 months ago
2008
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...