5995 search results - page 853 / 1199 » Algorithmic Game Theory |
170
Voted
GECCO
2005
Springer
16 years 7 days 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 ...
154
click to vote
COMPGEOM
2004
ACM
16 years 5 days 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...
161
click to vote
COMPGEOM
2004
ACM
16 years 5 days 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 ...
179
click to vote
ICML
2004
IEEE
16 years 5 days ago
2004
IEEE
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
187
click to vote
PADS
2004
ACM
16 years 4 days ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...