1061 search results - page 134 / 213 » Natural Selection in Relation to Complexity |
ICASSP
2011
IEEE
13 years 24 days ago
2011
IEEE
Nonparametric methods are widely applicable to statistical learning problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeat...
IACR
2011
12 years 8 months ago
2011
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
CHI
2008
ACM
14 years 9 months ago
2008
ACM
Temporal trajectories can represent the complex mappings between story time and clock time that are to be found in shared interactive narratives such as computer games and interac...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...