417 search results - page 52 / 84 » Some Theory for Generalized Boosting Algorithms |
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
FOCS
2004
IEEE
14 years 24 days ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
DIALM
2010
ACM
13 years 7 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
ICFP
2004
ACM
14 years 9 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
RECOMB
2003
Springer
14 years 9 months ago
2003
Springer
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the exis...