531 search results - page 7 / 107 » A Better Algorithm for Random k-SAT |
ICMLA
2008
13 years 9 months ago
2008
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
SIAMCOMP
2008
13 years 7 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...