1888 search results - page 136 / 378 » Proof theory and computational analysis |
128
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
224
click to vote
IACR
2011
14 years 8 days ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
141
Voted
FGR
2011
IEEE
14 years 4 months ago
2011
IEEE
— Despite major advances within the affective computing research field, modelling, analysing, interpreting and responding to naturalistic human affective behaviour still remains...
111
Voted
MMB
2004
Springer
15 years 6 months ago
2004
Springer
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correlated service times is performed. We study and compare the isolated impact of (...
106
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...