16430 search results - page 772 / 3286 » On Computable Tree Functions |
236
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
220
click to vote
TON
2008
15 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
201
click to vote
IACR
2011
14 years 7 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...
245
click to vote
Publication
Current mainstream Evolutionary Algorithms (EA) are based on the concept of selection, encapsulated in the definition of a fitness function. Besides selection, however, the natur...
202
click to vote
SMI
2005
IEEE
16 years 1 months ago
2005
IEEE
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...