395 search results - page 1 / 79 » Decision Problems for Convex Languages |
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
COR
2002
13 years 4 months ago
2002
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
LATIN
1992
Springer
13 years 9 months ago
1992
Springer
