182 search results - page 16 / 37 » A Theory of Strict P-completeness |
IJCAI
2003
15 years 1 months ago
2003
Different qualitative models have been proposed for decision under uncertainty in Artificial Intelli gence, but they generally fail to satisfy the princi ple of strict Pareto ...
CICLING
2003
Springer
15 years 5 months ago
2003
Springer
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...
COMCOM
1998
14 years 11 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
103
click to vote
JAPLL
2007
14 years 11 months ago
2007
We invoke concepts from the theory of hypergraphs to give a measure of the closeness of family resemblance, and to make precise the idea of a composite likeness. It is shown that f...
116
click to vote
ICDT
2012
ACM
13 years 2 months ago
2012
ACM
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...