1615 search results - page 4 / 323 » Computer science and decision theory |
IFIPTCS
2000
13 years 9 months ago
2000
FCT
2009
Springer
14 years 10 days ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
PC
2000
13 years 5 months ago
2000
A short overview is presented of the density functional theory and molecular dynamics (DFT
GI
2009
Springer
13 years 3 months ago
2009
Springer
: Both, games in a game theoretic sense and protocols in an informational sense describe rule based interactions between systems. Some similarities and differences of both approach...