Sciweavers

1995 search results - page 164 / 399
» What's the Problem
Sort
View
WER
2007
Springer
15 years 10 months ago
Evaluating the Effectiveness of Using Catalogues to Elicit Non-Functional Requirements
: Non-Functional Requirements (NFR) are subjective, interactive and relative, thus realizing the need for particular NFR is by itself a challenge. Furthermore understanding what th...
Luiz Marcio Cysneiros
WINE
2007
Springer
166views Economy» more  WINE 2007»
15 years 10 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
SUTC
2006
IEEE
15 years 10 months ago
The Computational Complexity of Enforceability Validation for Generic Access Control Rules
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
Vincent C. Hu, D. Richard Kuhn, David F. Ferraiolo
WETICE
2006
IEEE
15 years 10 months ago
Exploiting the TTL Rule in Unstructured Peer-to-Peer Networks
Peer-to-Peer networks exist with the volunteering cooperation of various entities on the Internet. Their self-structure nature has the important characteristic that they make no u...
Georgios Pitsilis, Panayiotis Periorellis
ACMSE
2006
ACM
15 years 10 months ago
Inductive bases and their application to searches for minimal unary NFAs
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
Geoffrey Smith