2735 search results - page 34 / 547 » Comparing notions of randomness |
113
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
125
click to vote
AAAI
2010
15 years 4 months ago
2010
In cooperative multiagent systems an alternative that maximizes the social welfare--the sum of utilities--can only be selected if each agent reports its full utility function. Thi...
136
click to vote
SACRYPT
2004
Springer
15 years 8 months ago
2004
Springer
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
124
click to vote
ICSE
2008
IEEE-ACM
16 years 4 months ago
2008
IEEE-ACM
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
116
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...