1585 search results - page 236 / 317 » Automatically optimizing secure computation |
105
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
102
click to vote
3DPVT
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
108
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
NIPS
2008
15 years 1 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
NIPS
1997
15 years 1 months ago
1997
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...