15033 search results - page 321 / 3007 » Complexity Theory and Algorithms |
168
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
151
click to vote
ICASSP
2008
IEEE
16 years 18 days ago
2008
IEEE
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
165
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
206
click to vote
HASKELL
2009
ACM
16 years 20 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
169
click to vote
CHES
1999
Springer
15 years 10 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...