417 search results - page 59 / 84 » Some Theory for Generalized Boosting Algorithms |
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
Agents collaborating on a set of tasks subject to temporal constraints must coordinate their activities to ensure that all of the temporal constraints are ultimately satisfied. S...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
RTA
2010
Springer
14 years 29 days ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...