10997 search results - page 131 / 2200 » On the Structure of Complete Sets |
158
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...
152
click to vote
WCE
2007
15 years 7 months ago
2007
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
184
click to vote
ASP
2005
Springer
15 years 11 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
152
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
180
Voted
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives without the burden of any form of negation. This complete ab...