Sciweavers

17541 search results - page 93 / 3509
» Complexity in scalable computing
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
ICNC
2005
Springer
15 years 3 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
SUTC
2006
IEEE
15 years 3 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
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 1 months ago
Genomic computing networks learn complex POMDPs
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
David J. Montana, Eric Van Wyk, Marshall Brinn, Jo...
FSTTCS
2008
Springer
14 years 11 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux