269 search results - page 2 / 54 » Complexity Theory Made Easy |
MCS
2007
Springer
13 years 4 months ago
2007
Springer
Using standard calculus, explicit formulas for the one-dimensional continuous and discrete homotopy operators are derived. It is shown that these formulas are equivalent to those ...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
AUSAI
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. The Belief, Desire, Intention (BDI) architecture is increasingly being used in a wide range of complex applications for agents. Many theories and models exist which suppo...
IPL
2006
13 years 4 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...