13603 search results - page 136 / 2721 » On the Computational Complexity of Cut-Reduction |
185
Voted
SIGECOM
2006
ACM
16 years 3 days ago
2006
ACM
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...
177
click to vote
ICNC
2005
Springer
15 years 11 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
152
Voted
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
144
Voted
SUTC
2006
IEEE
16 years 4 days ago
2006
IEEE
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...
158
click to vote
SAC
2006
ACM
16 years 3 days ago
2006
ACM
Complex environmental modeling often involves a large number of unknown physical and ecological parameters. Parameter estimation is one of the most difficult steps in many modelin...