5084 search results - page 627 / 1017 » Proving Possibility Properties |
205
click to vote
JSC
2010
15 years 5 months ago
2010
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...
186
click to vote
MST
2010
15 years 5 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
215
click to vote
NA
2010
15 years 5 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
178
click to vote
SACMAT
2010
ACM
15 years 5 months ago
2010
ACM
Role mining from the existing permissions has been widely applied to aid the process of migrating to an RBAC system. While all permissions are treated evenly in previous approache...
186
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...