2157 search results - page 218 / 432 » Binary ant algorithm |
148
Voted
CP
2008
Springer
15 years 8 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
150
Voted
NIPS
2007
15 years 7 months ago
2007
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
165
click to vote
IJCAI
2001
15 years 7 months ago
2001
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
136
click to vote
GRAPHICSINTERFACE
2000
15 years 7 months ago
2000
We present a method to incrementally voxelize triangles into a volumetric dataset with pre-filtering, generating an accurate multivalued voxelization. Multivalued voxelization all...
146
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...