937 search results - page 59 / 188 » On the Complexity of Partial Order Properties |
162
click to vote
IJCM
2002
15 years 5 months ago
2002
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
155
click to vote
APPROX
2009
Springer
16 years 18 days ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
159
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
The acquisition of geometric information from realworld objects has become a major way of modeling complex scenes and environments. Unfortunately, most optical methods for geometr...
151
click to vote
KER
2008
15 years 6 months ago
2008
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
142
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...