Sciweavers

182 search results - page 16 / 37
» A Theory of Strict P-completeness
Sort
View
IJCAI
2003
13 years 9 months ago
Qualitative Decision under Uncertainty: Back to Expected Utility
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 ...
Hélène Fargier, Régis Sabbadi...
CICLING
2003
Springer
14 years 25 days ago
Total Lexicalism and GASGrammars: A Direct Way to Semantics
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...
Gábor Alberti, Katalin Balogh, Judit Kleibe...
COMCOM
1998
102views more  COMCOM 1998»
13 years 7 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
JAPLL
2007
104views more  JAPLL 2007»
13 years 7 months ago
An axiomatization of family resemblance
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...
Ray E. Jennings, Dorian X. Nicholson
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 10 months ago
Win-move is coordination-free (sometimes)
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...
Daniel Zinn, Todd J. Green, Bertram Ludäscher