Sciweavers

1313 search results - page 159 / 263
» Generic Universe Types
Sort
View
FLAIRS
2000
15 years 6 months ago
A Multiagent Architecture to Support Distance Learning Personalization on the Web
This article presents the description of the objectives, the structure and the functionality of an interactive system intended to focus the teaching on the performanceof the stude...
Jesus Boticario, Elena Gaudioso
AI
2010
Springer
15 years 5 months ago
Property persistence in the situation calculus
We develop a new automated reasoning technique for the situation calculus that can handle a class of queries containing universal quantication over situation terms. Although such ...
Ryan F. Kelly, Adrian R. Pearce
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
15 years 5 months ago
On the Number of t-Ary Trees with a Given Path Length
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
Gadiel Seroussi
IJNSEC
2008
110views more  IJNSEC 2008»
15 years 5 months ago
Improvement on Nominative Proxy Signature Schemes
In a nominative proxy signature scheme, an original singer delegates his signing power to a proxy signer, who generates a nominative signature on behalf of the original signer. In...
Zuo-Wen Tan
JGAA
2006
108views more  JGAA 2006»
15 years 5 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello