Sciweavers

5084 search results - page 95 / 1017
» Proving Possibility Properties
Sort
View
AAAI
2008
13 years 11 months ago
Reasoning about Large Taxonomies of Actions
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Yilan Gu, Mikhail Soutchanski
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 10 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 4 months ago
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
Thomas Voice, Maria Polukarov, Andrew Byde, Nichol...
COCOON
2003
Springer
14 years 3 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
FSTTCS
2003
Springer
14 years 3 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh