4403 search results - page 523 / 881 » Galois Theory of Algorithms |
212
click to vote
ESA
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
197
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
The development of the XCS Learning Classifier System has produced a robust and stable implementation that performs competitively in direct-reward environments. Although investig...
209
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
174
click to vote
COMPGEOM
2004
ACM
16 years 1 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
178
click to vote
COMPGEOM
2004
ACM
16 years 1 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...